-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBigInt.cpp
299 lines (195 loc) · 6.48 KB
/
BigInt.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
289
290
291
292
293
294
295
296
297
298
299
#include <bits/stdc++.h>
using namespace std;
class BigInt{
private:
string num{""};
//some helpful methods
void remove_leading_zeros(string& n , bool front = false){
if(front){
while((int)n.size()>1 and n[0] == '0'){
n.erase(0,1);
}
}else{
while((int)n.size()>1 and n[n.size()-1] == '0'){
n.erase(n.size()-1,1);
}
}
}
void equalize(string& num , const int& diff){
string res{""};
for(int i = 0;i<diff;i++){
res+='0';
}
res += num;
num = res;
}
void do_equalize(string& num1 , string& num2){
int sz = max((int)num1.size() , (int)num2.size());
if((int)num1.size() != sz){
equalize(num1 , sz - (int)num1.size());
}else if((int)num2.size() != sz){
equalize(num2 , sz - (int)num2.size());
}
return;
}
bool _greater(string& num1 , string& num2){
for(int i = 0;i<(int)num1.size();i++){
if(num1[i]<num2[i])
return false;
else if(num1[i]>num2[i])
break;
}
return true;
}
/***************************************************************************************/
string add(string num2 , string tmp = ""){
string num1 = num;
if(tmp != "")
num1 = tmp;
int sz = max((int)num1.size() , (int)num2.size()),sum_of_2_digits{0} , carry{0};
string res{""};
do_equalize(num1,num2);
reverse(num1.begin() , num1.end()) , reverse(num2.begin() , num2.end());
for(int i = 0;i<sz;i++){
sum_of_2_digits = carry + (num1[i] - '0') + (num2[i] - '0');
carry = sum_of_2_digits / 10;
sum_of_2_digits %= 10;
res += to_string(sum_of_2_digits);
}
if(carry){
res += to_string(carry);
}
remove_leading_zeros(res);
reverse(res.begin() , res.end());
return res;
}
/***************************************************************************************/
string subtract(string num2){
string num1 = num;
int sz = max((int)num1.size() , (int)num2.size()) , sub_of_2_digits{0};
string res{""};
bool neg{false} , borrow{false};
do_equalize(num1,num2);
if(!_greater(num1,num2)){
swap(num1,num2);
neg = true;
}
reverse(num1.begin() , num1.end()) , reverse(num2.begin() , num2.end());
for(int i = 0;i<sz;i++){
sub_of_2_digits = (num1[i] - '0') - (num2[i] - '0');
if(borrow){
sub_of_2_digits--;
borrow = false;
}
if(sub_of_2_digits < 0){
borrow = true;
sub_of_2_digits += 10;
}
res += to_string(sub_of_2_digits);
}
remove_leading_zeros(res);
if(neg){
res+='-';
}
reverse(res.begin() , res.end());
return res;
}
/****************************************************************/
string multiply(string num2){
string num1 = num;
string tmp{""},res {"0"};
int mul_of_2_digits{0},rem{0};
for(int i = (int)num1.size()-1;i>=0;--i){
for(int j = (int)num2.size()-1;j>=0;--j){
mul_of_2_digits = (num1[i]-'0') * (num2[j]-'0');
mul_of_2_digits += rem;
rem = mul_of_2_digits/10;
mul_of_2_digits%=10;
tmp+=to_string(mul_of_2_digits);
}
if(rem){
tmp+=to_string(rem);
rem = 0;
}
reverse(tmp.begin(),tmp.end());
for(int j = 0;j<(int)num1.size()-1-i;j++){
tmp+='0';
}
res = add(tmp,res);
tmp = "";
}
return res;
}
/****************************************************************/
string divide(int divisor) {
string n = num;
string res{""};
int digit{0};
for(int i = 0;i<(int)n.size();i++){
digit *= 10;
digit += (n[i] - '0');
res += (digit / divisor) + '0';
digit %= divisor;
}
remove_leading_zeros(res,true);
return res;
}
public:
BigInt(string num):num(num){}
string getNum() const{
return num;
}
BigInt operator +(const BigInt& B){
return BigInt(add(B.getNum()));
}
BigInt operator +(long long num){
return BigInt(add(to_string(num)));
}
BigInt operator -(const BigInt& B){
return BigInt(subtract(B.getNum()));
}
BigInt operator -(long long num){
return BigInt(subtract(to_string(num)));
}
BigInt operator *(const BigInt& B){
return BigInt(multiply(B.getNum()));
}
BigInt operator *(long long num){
return BigInt(multiply(to_string(num)));
}
BigInt operator /(int num){
return BigInt(divide(num));
}
};
ostream &operator<<(ostream &out, BigInt b){
out<<b.getNum();
return out;
}
void test1(){
BigInt b1("123456789012345678901234567890") , b2("113456789011345678901134567890");
BigInt add = b1 + b2 ;
BigInt sub = b1 - b2 ;
BigInt mul = b1 * b2 ;
BigInt div = b1 / 3 ;
cout<<"/////////////////////test1\\\\\\\\\\\\\\\\\\\\\ \n";
cout<<"Addition : "<<add<<"\n"; // 236913578023691357802369135780
cout<<"Subtraction : "<<sub<<"\n"; // 10000000001000000000100000000
cout<<"Multiplication : "<<mul<<"\n"; // 14007010862991923172458314525833729651721781743086019052100
cout<<"Division : "<<div<<"\n\n\n"; // 41152263004115226300411522630
}
void test2(){
BigInt b1("123456789012345678901234567890") , b2("000000");
BigInt add = b1 + b2 ;
BigInt sub = b1 - b2 ;
BigInt mul = b1 * b2 ;
BigInt div = b1 / 15 ;
cout<<"/////////////////////test2\\\\\\\\\\\\\\\\\\\\\ \n";
cout<<"Addition : "<<add<<"\n";
cout<<"Subtraction : "<<sub<<"\n";
cout<<"Multiplication : "<<mul<<"\n";
cout<<"Division : "<<div<<"\n\n\n";
}
int main(){
test1();
test2();
}