forked from Mircea-Stefan/Competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Big integers class without FFT.cpp
288 lines (264 loc) · 8.46 KB
/
Big integers class without FFT.cpp
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
#include <vector>
const uint64_t base = 10;
class BigInt {
public:
std::vector <uint64_t> digit;
BigInt(uint64_t n = 0) {
do {
digit.emplace_back(n % base);
n /= base;
} while (n != 0);
}
BigInt(const BigInt &a) {
for (uint32_t i = 0; i < a.digit.size(); ++i)
digit.emplace_back(a.digit[i]);
}
friend bool operator<(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return a.digit.size() < b.digit.size();
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i)
if (a.digit[i] != b.digit[i])
return a.digit[i] < b.digit[i];
return false;
}
friend bool operator>(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return a.digit.size() > b.digit.size();
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i)
if (a.digit[i] != b.digit[i])
return a.digit[i] > b.digit[i];
return false;
}
friend bool operator==(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return false;
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i)
if (a.digit[i] != b.digit[i])
return false;
return true;
}
friend bool operator!=(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return true;
int32_t i;
for (i = a.digit.size() - 1; i != -1; --i)
if (a.digit[i] != b.digit[i])
return true;
return false;
}
friend bool operator<=(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return a.digit.size() < b.digit.size();
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i)
if (a.digit[i] != b.digit[i])
return a.digit[i] < b.digit[i];
return true;
}
friend bool operator>=(BigInt a, BigInt b) {
if (a.digit.size() != b.digit.size())
return a.digit.size() > b.digit.size();
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i)
if (a.digit[i] != b.digit[i])
return a.digit[i] > b.digit[i];
return true;
}
BigInt operator=(uint64_t a) {
digit.clear();
do {
digit.emplace_back(a % base);
a /= base;
} while (a != 0);
return *this;
}
BigInt operator=(BigInt a) {
digit.clear();
for (uint32_t i = 0; i < a.digit.size(); ++i)
digit.emplace_back(a.digit[i]);
return *this;
}
friend BigInt operator+(BigInt a, uint64_t b) {
BigInt ans;
uint32_t i;
uint64_t carry = b;
for (i = 0; i < a.digit.size(); ++i) {
carry += a.digit[i];
ans.digit.emplace_back(carry % base);
carry /= base;
}
while (carry != 0) {
ans.digit.emplace_back(carry % base);
carry /= base;
}
return ans;
}
friend BigInt operator+(BigInt a, BigInt b) {
BigInt ans;
if (a.digit.size() > b.digit.size())
std::swap(a, b);
uint32_t i;
uint64_t carry = 0;
for (i = 0; i < a.digit.size(); ++i) {
carry += a.digit[i] + b.digit[i];
ans.digit.emplace_back(carry % base);
carry /= base;
}
for (i = a.digit.size(); i < b.digit.size(); ++i) {
carry += b.digit[i];
ans.digit.emplace_back(carry % base);
carry /= base;
}
while (carry != 0) {
ans.digit.emplace_back(carry % base);
carry /= base;
}
return ans;
}
friend BigInt operator-(BigInt a, BigInt b) {
if (a < b)
std::swap(a, b);
BigInt ans;
uint32_t i, j;
for (i = 0; i < a.digit.size(); ++i)
if (a.digit[i] >= b.digit[i])
ans.digit.emplace_back(a.digit[i] - b.digit[i]);
else {
for (j = i + 1; a.digit[j] == 0; ++j)
a.digit[j] = base - 1;
--a.digit[j];
ans.digit.emplace_back(base - b.digit[i] + a.digit[i]);
}
while (ans.digit.empty() == false and ans.digit.back() == 0)
ans.digit.pop_back();
if (ans.digit.empty() == true)
ans.digit.emplace_back(0);
return ans;
}
friend BigInt operator-(BigInt a, uint64_t b) {
BigInt ans(b);
if (a < ans)
std::swap(a, ans);
ans = ans - a;
return ans;
}
friend BigInt operator*(BigInt a, uint64_t b) {
uint64_t carry = 0;
uint32_t i;
BigInt ans;
ans.digit.clear();
for (i = 0; i < a.digit.size(); ++i) {
carry += a.digit[i] * b;
ans.digit.emplace_back(carry % base);
carry /= base;
}
while (carry != 0) {
ans.digit.emplace_back(carry % base);
carry /= base;
}
while (ans.digit.empty() == false and ans.digit.back() == 0)
ans.digit.pop_back();
if (ans.digit.empty() == true)
ans.digit.emplace_back(0);
return ans;
}
friend BigInt operator*(BigInt a, BigInt b) {
BigInt ans;
uint32_t i, j;
for (i = 1; i < a.digit.size() + b.digit.size(); ++i)
ans.digit.emplace_back(0);
for (i = 0; i < a.digit.size(); ++i)
for (j = 0; j < b.digit.size(); ++j)
ans.digit[i + j] += a.digit[i] * b.digit[j];
uint64_t carry = 0;
for (i = 0; i < ans.digit.size(); ++i) {
carry += ans.digit[i];
ans.digit[i] = carry % base;
carry /= base;
}
while (carry != 0) {
ans.digit.emplace_back(carry % base);
carry /= base;
}
while (ans.digit.empty() == false and ans.digit.back() == 0)
ans.digit.pop_back();
if (ans.digit.empty() == true)
ans.digit.emplace_back(0);
return ans;
}
friend BigInt operator/(BigInt a, uint64_t b) {
BigInt ans;
uint64_t carry = 0;
int32_t i;
for (i = 1; i < a.digit.size(); ++i)
ans.digit.emplace_back(0);
for (i = a.digit.size() - 1; i >= 0; --i) {
carry *= base;
carry += a.digit[i];
ans.digit[i] = carry / b;
carry %= b;
}
while (ans.digit.empty() == false and ans.digit.back() == 0)
ans.digit.pop_back();
if (ans.digit.empty() == true)
ans.digit.emplace_back(0);
return ans;
}
friend BigInt operator/(BigInt a, BigInt b) {
BigInt ans, aux;
if (a < b)
return ans;
int32_t i;
for (i = 1; i < a.digit.size(); ++i)
ans.digit.emplace_back(0);
for (i = a.digit.size() - 1; i >= 0; --i) {
aux = aux * base + a.digit[i];
while (aux > b) {
aux = aux - b;
ans.digit[i] = ans.digit[i] + 1;
}
if (aux == b) {
aux = 0;
ans.digit[i] = ans.digit[i] + 1;
}
}
while (ans.digit.empty() == false and ans.digit.back() == 0)
ans.digit.pop_back();
return ans;
}
friend uint64_t operator%(BigInt a, uint64_t b) {
uint64_t carry = 0;
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i) {
carry *= base;
carry += a.digit[i];
carry %= b;
}
return carry;
}
friend BigInt operator%(BigInt a, BigInt b) {
if (a < b)
return a;
BigInt ans;
int32_t i;
for (i = a.digit.size() - 1; i >= 0; --i) {
ans = ans * base + a.digit[i];
while (ans > b)
ans = ans - b;
if (ans == b)
ans = 0;
}
return ans;
}
friend std::ostream &operator<<(std::ostream &f, BigInt a) {
for (int32_t i = a.digit.size() - 1; i >= 0; --i)
f << a.digit[i];
return f;
}
~BigInt() {
digit.clear();
}
};