summaryrefslogtreecommitdiff
path: root/content/math/bigint.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'content/math/bigint.cpp')
-rw-r--r--content/math/bigint.cpp67
1 files changed, 34 insertions, 33 deletions
diff --git a/content/math/bigint.cpp b/content/math/bigint.cpp
index 1b3b953..a40f515 100644
--- a/content/math/bigint.cpp
+++ b/content/math/bigint.cpp
@@ -7,9 +7,9 @@ struct bigint {
bigint() : sign(1) {}
- bigint(ll v) {*this = v;}
+ bigint(ll v) { *this = v; }
- bigint(const string &s) {read(s);}
+ bigint(const string &s) { read(s); }
void operator=(ll v) {
sign = 1;
@@ -22,10 +22,11 @@ struct bigint {
bigint operator+(const bigint& v) const {
if (sign == v.sign) {
bigint res = v;
- for (ll i = 0, carry = 0; i < max(sz(a), sz(v.a)) || carry; ++i) {
- if (i == sz(res.a))
+ for (ll i = 0, carry = 0;
+ i < max(ssize(a), ssize(v.a)) || carry; ++i) {
+ if (i == ssize(res.a))
res.a.push_back(0);
- res.a[i] += carry + (i < sz(a) ? a[i] : 0);
+ res.a[i] += carry + (i < ssize(a) ? a[i] : 0);
carry = res.a[i] >= base;
if (carry)
res.a[i] -= base;
@@ -39,8 +40,8 @@ struct bigint {
if (sign == v.sign) {
if (abs() >= v.abs()) {
bigint res = *this;
- for (ll i = 0, carry = 0; i < sz(v.a) || carry; ++i) {
- res.a[i] -= carry + (i < sz(v.a) ? v.a[i] : 0);
+ for (ll i = 0, carry = 0; i < ssize(v.a) || carry; ++i) {
+ res.a[i] -= carry + (i < ssize(v.a) ? v.a[i] : 0);
carry = res.a[i] < 0;
if (carry) res.a[i] += base;
}
@@ -54,8 +55,8 @@ struct bigint {
void operator*=(ll v) {
if (v < 0) sign = -sign, v = -v;
- for (ll i = 0, carry = 0; i < sz(a) || carry; ++i) {
- if (i == sz(a)) a.push_back(0);
+ for (ll i = 0, carry = 0; i < ssize(a) || carry; ++i) {
+ if (i == ssize(a)) a.push_back(0);
ll cur = a[i] * v + carry;
carry = cur / base;
a[i] = cur % base;
@@ -74,12 +75,12 @@ struct bigint {
bigint a = a1.abs() * norm;
bigint b = b1.abs() * norm;
bigint q, r;
- q.a.resize(sz(a.a));
- for (ll i = sz(a.a) - 1; i >= 0; i--) {
+ q.a.resize(ssize(a.a));
+ for (ll i = ssize(a.a) - 1; i >= 0; i--) {
r *= base;
r += a.a[i];
- ll s1 = sz(r.a) <= sz(b.a) ? 0 : r.a[sz(b.a)];
- ll s2 = sz(r.a) <= sz(b.a) - 1 ? 0 : r.a[sz(b.a) - 1];
+ ll s1 = ssize(r.a) <= ssize(b.a) ? 0 : r.a[ssize(b.a)];
+ ll s2 = ssize(r.a) <= ssize(b.a) - 1 ? 0 : r.a[ssize(b.a) - 1];
ll d = (base * s1 + s2) / b.a.back();
r -= b * d;
while (r < 0) r += b, --d;
@@ -102,7 +103,7 @@ struct bigint {
void operator/=(ll v) {
if (v < 0) sign = -sign, v = -v;
- for (ll i = sz(a) - 1, rem = 0; i >= 0; --i) {
+ for (ll i = ssize(a) - 1, rem = 0; i >= 0; --i) {
ll cur = a[i] + rem * base;
a[i] = cur / v;
rem = cur % v;
@@ -119,7 +120,7 @@ struct bigint {
ll operator%(ll v) const {
if (v < 0) v = -v;
ll m = 0;
- for (ll i = sz(a) - 1; i >= 0; --i)
+ for (ll i = ssize(a) - 1; i >= 0; --i)
m = (a[i] + m * base) % v;
return m * sign;
}
@@ -139,9 +140,9 @@ struct bigint {
bool operator<(const bigint& v) const {
if (sign != v.sign) return sign < v.sign;
- if (sz(a) != sz(v.a))
- return sz(a) * sign < sz(v.a) * v.sign;
- for (ll i = sz(a) - 1; i >= 0; i--)
+ if (ssize(a) != ssize(v.a))
+ return ssize(a) * sign < ssize(v.a) * v.sign;
+ for (ll i = ssize(a) - 1; i >= 0; i--)
if (a[i] != v.a[i])
return a[i] * sign < v.a[i] * sign;
return false;
@@ -169,7 +170,7 @@ struct bigint {
}
bool isZero() const {
- return a.empty() || (sz(a) == 1 && a[0] == 0);
+ return a.empty() || (ssize(a) == 1 && a[0] == 0);
}
bigint operator-() const {
@@ -186,7 +187,7 @@ struct bigint {
ll longValue() const {
ll res = 0;
- for (ll i = sz(a) - 1; i >= 0; i--)
+ for (ll i = ssize(a) - 1; i >= 0; i--)
res = res * base + a[i];
return res * sign;
}
@@ -195,11 +196,11 @@ struct bigint {
sign = 1;
a.clear();
ll pos = 0;
- while (pos < sz(s) && (s[pos] == '-' || s[pos] == '+')) {
+ while (pos < ssize(s) && (s[pos] == '-' || s[pos] == '+')) {
if (s[pos] == '-') sign = -sign;
++pos;
}
- for (ll i = sz(s) - 1; i >= pos; i -= base_digits) {
+ for (ll i = ssize(s) - 1; i >= pos; i -= base_digits) {
ll x = 0;
for (ll j = max(pos, i - base_digits + 1); j <= i; j++)
x = x * 10 + s[j] - '0';
@@ -218,13 +219,13 @@ struct bigint {
friend ostream& operator<<(ostream& stream, const bigint& v) {
if (v.sign == -1) stream << '-';
stream << (v.a.empty() ? 0 : v.a.back());
- for (ll i = sz(v.a) - 2; i >= 0; --i)
+ for (ll i = ssize(v.a) - 2; i >= 0; --i)
stream << setw(base_digits) << setfill('0') << v.a[i];
return stream;
}
static vll karatsubaMultiply(const vll& a, const vll& b) {
- ll n = sz(a);
+ ll n = ssize(a);
vll res(n + n);
if (n <= 32) {
for (ll i = 0; i < n; i++)
@@ -242,25 +243,25 @@ struct bigint {
for (ll i = 0; i < k; i++) a2[i] += a1[i];
for (ll i = 0; i < k; i++) b2[i] += b1[i];
vll r = karatsubaMultiply(a2, b2);
- for (ll i = 0; i < sz(a1b1); i++) r[i] -= a1b1[i];
- for (ll i = 0; i < sz(a2b2); i++) r[i] -= a2b2[i];
- for (ll i = 0; i < sz(r); i++) res[i + k] += r[i];
- for (ll i = 0; i < sz(a1b1); i++) res[i] += a1b1[i];
- for (ll i = 0; i < sz(a2b2); i++) res[i + n] += a2b2[i];
+ for (ll i = 0; i < ssize(a1b1); i++) r[i] -= a1b1[i];
+ for (ll i = 0; i < ssize(a2b2); i++) r[i] -= a2b2[i];
+ for (ll i = 0; i < ssize(r); i++) res[i + k] += r[i];
+ for (ll i = 0; i < ssize(a1b1); i++) res[i] += a1b1[i];
+ for (ll i = 0; i < ssize(a2b2); i++) res[i + n] += a2b2[i];
return res;
}
bigint operator*(const bigint& v) const {
vll ta(a.begin(), a.end());
vll va(v.a.begin(), v.a.end());
- while (sz(ta) < sz(va)) ta.push_back(0);
- while (sz(va) < sz(ta)) va.push_back(0);
- while (sz(ta) & (sz(ta) - 1))
+ while (ssize(ta) < ssize(va)) ta.push_back(0);
+ while (ssize(va) < ssize(ta)) va.push_back(0);
+ while (ssize(ta) & (ssize(ta) - 1))
ta.push_back(0), va.push_back(0);
vll ra = karatsubaMultiply(ta, va);
bigint res;
res.sign = sign * v.sign;
- for (ll i = 0, carry = 0; i < sz(ra); i++) {
+ for (ll i = 0, carry = 0; i < ssize(ra); i++) {
ll cur = ra[i] + carry;
res.a.push_back(cur % base);
carry = cur / base;
generated by cgit v1.2.3 (git 2.39.1) at 2025-12-23 16:20:40 +0000