1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/*
* Normaliz
* Copyright (C) 2007-2014 Winfried Bruns, Bogdan Ichim, Christof Soeger
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As an exception, when this program is distributed through (i) the App Store
* by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or (iii) Google Play
* by Google Inc., then that store may impose any digital rights management,
* device limits and/or redistribution restrictions that are required by its
* terms of service.
*/
//---------------------------------------------------------------------------
#include <algorithm>
#include <sstream>
#include "libQnormaliz/Qinteger.h"
#include "libQnormaliz/Qvector_operations.h"
//---------------------------------------------------------------------------
namespace libQnormaliz {
using namespace std;
/*
bool try_convert(long& ret, const long long& val) {
assert(false); return true;
}
bool try_convert(long& ret, const mpq_class& val) {
assert(false); return true;
}
bool try_convert(long long& ret, const mpq_class& val) {
assert(false); return true;
}
bool try_convert(mpq_class& ret, const long long& val) {
assert(false); return true;
}
bool fits_long_range(long long a) {
return sizeof(long long) == sizeof(long) || (a <= LONG_MAX && a >= LONG_MIN);
}
*/
//---------------------------------------------------------------------------
template <typename Number>
size_t decimal_length(Number a){
/* size_t l=1;
if (a<0) {
a=-a;
l++;
}
while((a/=10)!=0)
l++;*/
ostringstream test;
test << a;
// cout << "L " << a << " D " << test.str().size() << endl;
return test.str().size();
}
//---------------------------------------------------------------------------
template <typename Number>
Number permutations(const size_t& a, const size_t& b){
unsigned long i;
Number P=1;
for (i = a+1; i <= b; i++) {
P*=i;
}
return P;
}
//---------------------------------------------------------------------------
template<typename Number>
Number permutations_modulo(const size_t& a, const size_t& b, long m) {
unsigned long i;
Number P=1;
for (i = a+1; i <= b; i++) {
P*=i; P%=m;
}
return P;
}
// some conversions
} //end namespace libQnormaliz
|
