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
107
108
109
110
|
/*
* Normaliz 2.7
* Copyright (C) 2007-2011 Winfried Bruns, Bogdan Ichim, Christof Soeger
* 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/>.
*
*/
//---------------------------------------------------------------------------
#include <algorithm>
#include "integer.h"
//---------------------------------------------------------------------------
namespace libnormaliz {
using namespace std;
template <typename Integer>
Integer gcd(const Integer& a, const Integer& b){
if (a==0) {
return Iabs<Integer>(b);
}
if (b==0) {
return Iabs<Integer>(a);
}
Integer q0,q1,r;
q0=Iabs<Integer>(a);
r=Iabs<Integer>(b);
do {
q1=r;
r=q0%q1;
q0=q1;
} while (r!=0);
return q1;
}
template<> mpz_class gcd<mpz_class>(const mpz_class& a, const mpz_class& b) {
mpz_class g;
mpz_gcd (g.get_mpz_t(), a.get_mpz_t(), b.get_mpz_t());
return g;
}
//---------------------------------------------------------------------------
template <typename Integer>
Integer lcm(const Integer& a, const Integer& b){
if ((a==0)||(b==0)) {
return 0;
}
else
return Iabs<Integer>(a*b/gcd<Integer>(a,b));
}
template<> mpz_class lcm<mpz_class>(const mpz_class& a, const mpz_class& b) {
mpz_class g;
mpz_lcm (g.get_mpz_t(), a.get_mpz_t(), b.get_mpz_t());
return g;
}
//---------------------------------------------------------------------------
template <typename Integer>
size_t decimal_length(Integer a){
size_t l=1;
if (a<0) {
a=-a;
l++;
}
while((a/=10)!=0)
l++;
return l;
}
//---------------------------------------------------------------------------
template <typename Integer>
Integer permutations(const size_t& a, const size_t& b){
unsigned long i;
Integer P=1;
for (i = a+1; i <= b; i++) {
P*=i;
}
return P;
}
//---------------------------------------------------------------------------
template<typename Integer>
Integer permutations_modulo(const size_t& a, const size_t& b, long m) {
unsigned long i;
Integer P=1;
for (i = a+1; i <= b; i++) {
P*=i; P%=m;
}
return P;
}
//---------------------------------------------------------------------------
}
|
