-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mult.cpp
159 lines (141 loc) · 2.9 KB
/
Mult.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
#include "Long.h"
#include "Real.h"
template <class T>
T binsearch(const Long& a, const Long& b, Long& pr, const T& _l, const T& _r);
Long Long::mul(const Long& b) const
{
int fl = (sign * b.sign);
Long tmp;
int len = size() + b.size() - 1;
if (len <= 0) return null;
tmp.insert(vector<ull>(len, 0));
for (uint i = 0; i < size(); ++i)
for (uint j = 0; j < b.size(); ++j)
tmp.a[i + j] += a[i] * b[j];
return tmp.normal().changeSign(fl);
}
Long Long::divide(const int b, Long& rem) const
{
if (b == 0 || size() == 0)
throw "Division by zero!";
auto t = b;
ull c = 0;
int fl = (sign);
if (b < 0) {
fl = (fl * 0);
t = ::abs(b);
}
Long r = *this;
for (int i = size() - 1; i >= 0; i--) {
c = a[i] + c * base;
r.set(i, c / t);
c = c % t;
}
rem = c;
return r.normal().changeSign(fl);
}
Long Long::divide(const Long & b, Long& rem) const
{
if (size() == 0 || b.size() == 0 || b == 0)
throw "Division by zero!";
else if ((size() == 1 && a[0] == 0))
return 0;
else if (size() < b.size() || *this < b) {
rem = *this;
return null;
}
else if (*this == b)
return pone;
else if (b.size() == 1)
return divide((int)b[0], rem);
auto t = b;
int fl = (sign);
if (t < 0) {
fl = (fl * -1);
t.changeSign();
}
Long r(vector<ull>(size(), 0)); Long c;
ull tmp = 0;
for (int i = size() - 1; i >= 0; i--) {
c.shift(); c.set(0, a[i]);
tmp = 0;
if (c.size() >= b.size() && (c >= b)) {
if (c == b) {
c.clear();
r.set(i, (ull)1);
}
else {
auto pr = null;
auto mid = binsearch<ull>(c, b, pr, 0, base);
c = c - pr;
if (c == null)
c.clear();
r.set(i, mid);
}
}
else
r.set(i, tmp);
}
rem = c.normal();
return r.normal().changeSign(fl);
}
template <class T>
T binsearch(const Long& a, const Long& b, Long& pr, const T& _l, const T& _r) {
auto l = _l, r = _r;
auto mid = (r + l) / 2;
auto mid_pr = mid;
do {
pr = b * (mid);
mid_pr = mid;
if (pr < a)
l = mid;
else if (pr > a)
r = mid;
else
break;
mid = (r + l) / 2;
} while (mid != mid_pr);
return mid;
}
Long Long::divide2(const Long & b, Long& rem) const
{
if (size() == 0 || b.size() == 0 || b == 0)
throw "Division by zero!";
else if ((size() == 1 && a[0] == 0))
return 0;
else if (size() < b.size() || *this < b) {
rem = *this;
return null;
}
else if (*this == b)
return pone;
else if (b.size() == 1)
return divide((int)b[0], rem);
auto t = b;
int fl = (sign);
if (t < 0) {
fl = (fl * -1);
t.changeSign();
}
Long r, c;
ull tmp = 0;
r = binsearch(*this, b, c, null, *this);
c = *this - r;
if (c == null)
c.clear();
rem = c.normal();
return r.normal().changeSign(fl);
}
Long Long::mult_inv(const Long& b) const
{
int fl = (sign * b.sign);
Long tmp;
int len = size() + b.size() - 1;
if (len <= 0) return null;
auto _b = inverse(b);
int i = 0;
while (size() * bs - i> 5 && b.size() * bs - i> 5) {
i += bs;
}
return to_Long(_b * *this);
}