-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patharith_int.cpp
136 lines (135 loc) · 2.62 KB
/
arith_int.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
#include "header.hpp"
vector<int> QuoRem(int x, int base)
{
vector<int> ans;
int q = x/base;
int rem = x%base;
if(rem < 0)
{
rem += base;
q -= 1;
}
ans.push_back(q);
ans.push_back(rem);
return ans;
}
int AddZeros(vector <int> &a,vector<int> &b)
{
int extra = a.size() - b.size();
while(extra > 0)
{
b.push_back(0);
extra--;
}
while(extra < 0)
{
a.push_back(0);
extra++;
}
return a.size();
}
void add(vector<int> &a,vector<int> &b,vector<int> &c,int B)
{
int carry = 0,k=a.size(),l=b.size(),tmp;
for (int i = 0; i < l; i++)
{
tmp = a[i] + b[i] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
c.push_back(tmp_vec[1]);
}
for(int i=l ;i< k ;i++)
{
tmp = a[i] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
c.push_back(tmp_vec[1]);
}
if(carry)
{
c.push_back(carry);
}
}
void mul(vector<int> &a,vector<int> &b,vector<int> &c,int B)
{
int k = a.size(),l = b.size(),carry = 0;
for(int i=0;i<(k+l);i++)
{
c.push_back(0);
}
for(int i=0;i<k;i++)
{
carry = 0;
for(int j=0;j<l;j++)
{
int tmp = a[i]*b[j] + c[i+j] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
c[i+j] = tmp_vec[1];
}
c[i+l] = carry;
}
}
void div(vector<int> &a,vector<int> &b,vector<int> &q,vector<int> &r,int B)
{
int k = a.size(),l = b.size();
for (int i = 0; i < k; i++)
{
r.push_back(a[i]);
q.push_back(0);
}
r.push_back(0);
for(int i = (k-l);i>=0;i--)
{
q[i] = (r[i+l]*B + r[i+l-1])/b[l-1];
if(q[i] >= B) q[i] = B - 1;
int carry = 0;
for(int j=0 ;j<l;j++)
{
int tmp = r[i+j] - q[i]*b[j] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
r[i+j] = tmp_vec[1];
}
r[i+l] = r[i+l] + carry;
while (r[i+l] < 0)
{
carry =0;
for(int j=0;j<l;j++)
{
int tmp = r[i+j] + b[j] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
r[i+j] = tmp_vec[1];
}
r[i+l] = r[i+l] + carry;
q[i] = q[i] - 1;
}
}
for(int i = (k-l+1);i<q.size();i++)
{
q.pop_back();
}
for(int i=l;i<r.size();i++)
{
r.pop_back();
}
}
void sub(vector<int> &a,vector<int> &b,vector<int> &c,int B)
{
int carry = 0,k=a.size(),l=b.size(),tmp;
for (int i = 0; i < l; i++)
{
tmp = a[i] - b[i] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
c.push_back(tmp_vec[1]);
}
for(int i=l ;i< k ;i++)
{
tmp = a[i] + carry;
vector<int> tmp_vec = QuoRem(tmp,B);
carry = tmp_vec[0];
c.push_back(tmp_vec[1]);
}
}