dont use .size()

1 files changed, 31 insertions, 31 deletions

diff --git a/math/bigint.cpp b/math/bigint.cpp
index f8e3507..59d6afe 100644
--- a/math/bigint.cpp
+++ b/math/bigint.cpp
@@ -26,10 +26,10 @@ struct bigint {
 	bigint operator+(const bigint& v) const {
 		if (sign == v.sign) {
 			bigint res = v;
-			for (ll i = 0, carry = 0; i < (ll)max(a.size(), v.a.size()) || carry; ++i) {
-				if (i == (ll)res.a.size())
+			for (ll i = 0, carry = 0; i < max(sz(a), sz(v.a)) || carry; ++i) {
+				if (i == sz(res.a))
 					res.a.push_back(0);
-				res.a[i] += carry + (i < (ll)a.size() ? a[i] : 0);
+				res.a[i] += carry + (i < sz(a) ? a[i] : 0);
 				carry = res.a[i] >= base;
 				if (carry)
 					res.a[i] -= base;
@@ -43,8 +43,8 @@ struct bigint {
 		if (sign == v.sign) {
 			if (abs() >= v.abs()) {
 				bigint res = *this;
-				for (ll i = 0, carry = 0; i < (ll)v.a.size() || carry; ++i) {
-					res.a[i] -= carry + (i < (ll)v.a.size() ? v.a[i] : 0);
+				for (ll i = 0, carry = 0; i < sz(v.a) || carry; ++i) {
+					res.a[i] -= carry + (i < sz(v.a) ? v.a[i] : 0);
 					carry = res.a[i] < 0;
 					if (carry) res.a[i] += base;
 				}
@@ -58,8 +58,8 @@ struct bigint {
 
 	void operator*=(ll v) {
 		if (v < 0) sign = -sign, v = -v;
-		for (ll i = 0, carry = 0; i < (ll)a.size() || carry; ++i) {
-			if (i == (ll)a.size()) a.push_back(0);
+		for (ll i = 0, carry = 0; i < sz(a) || carry; ++i) {
+			if (i == sz(a)) a.push_back(0);
 			ll cur = a[i] * v + carry;
 			carry = cur / base;
 			a[i] = cur % base;
@@ -78,12 +78,12 @@ struct bigint {
 		bigint a = a1.abs() * norm;
 		bigint b = b1.abs() * norm;
 		bigint q, r;
-		q.a.resize(a.a.size());
-		for (ll i = (ll)a.a.size() - 1; i >= 0; i--) {
+		q.a.resize(sz(a.a));
+		for (ll i = sz(a.a) - 1; i >= 0; i--) {
 			r *= base;
 			r += a.a[i];
-			ll s1 = r.a.size() <= b.a.size() ? 0 : r.a[b.a.size()];
-			ll s2 = r.a.size() <= b.a.size() - 1 ? 0 : r.a[b.a.size() - 1];
+			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 d = (base * s1 + s2) / b.a.back();
 			r -= b * d;
 			while (r < 0) r += b, --d;
@@ -106,7 +106,7 @@ struct bigint {
 
 	void operator/=(ll v) {
 		if (v < 0) sign = -sign, v = -v;
-		for (ll i = (ll)a.size() - 1, rem = 0; i >= 0; --i) {
+		for (ll i = sz(a) - 1, rem = 0; i >= 0; --i) {
 			ll cur = a[i] + rem * base;
 			a[i] = cur / v;
 			rem = cur % v;
@@ -123,7 +123,7 @@ struct bigint {
 	ll operator%(ll v) const {
 		if (v < 0) v = -v;
 		ll m = 0;
-		for (ll i = (ll)a.size() - 1; i >= 0; --i)
+		for (ll i = sz(a) - 1; i >= 0; --i)
 			m = (a[i] + m * base) % v;
 		return m * sign;
 	}
@@ -143,9 +143,9 @@ struct bigint {
 
 	bool operator<(const bigint& v) const {
 		if (sign != v.sign) return sign < v.sign;
-		if (a.size() != v.a.size())
-			return a.size() * sign < v.a.size() * v.sign;
-		for (ll i = (ll)a.size() - 1; i >= 0; i--)
+		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 (a[i] != v.a[i])
 				return a[i] * sign < v.a[i] * sign;
 		return false;
@@ -173,7 +173,7 @@ struct bigint {
 	}
 
 	bool isZero() const {
-		return a.empty() || (a.size() == 1 && a[0] == 0);
+		return a.empty() || (sz(a) == 1 && a[0] == 0);
 	}
 
 	bigint operator-() const {
@@ -190,7 +190,7 @@ struct bigint {
 
 	ll longValue() const {
 		ll res = 0;
-		for (ll i = (ll)a.size() - 1; i >= 0; i--)
+		for (ll i = sz(a) - 1; i >= 0; i--)
 			res = res * base + a[i];
 		return res * sign;
 	}
@@ -199,11 +199,11 @@ struct bigint {
 		sign = 1;
 		a.clear();
 		ll pos = 0;
-		while (pos < (ll)s.size() && (s[pos] == '-' || s[pos] == '+')) {
+		while (pos < sz(s) && (s[pos] == '-' || s[pos] == '+')) {
 			if (s[pos] == '-') sign = -sign;
 			++pos;
 		}
-		for (ll i = (ll)s.size() - 1; i >= pos; i -= base_digits) {
+		for (ll i = sz(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';
@@ -222,13 +222,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 = (ll)v.a.size() - 2; i >= 0; --i)
+		for (ll i = sz(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 = a.size();
+		ll n = sz(a);
 		vll res(n + n);
 		if (n <= 32) {
 			for (ll i = 0; i < n; i++)
@@ -246,25 +246,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 < (ll)a1b1.size(); i++) r[i] -= a1b1[i];
-		for (ll i = 0; i < (ll)a2b2.size(); i++) r[i] -= a2b2[i];
-		for (ll i = 0; i < (ll)r.size(); i++) res[i + k] += r[i];
-		for (ll i = 0; i < (ll)a1b1.size(); i++) res[i] += a1b1[i];
-		for (ll i = 0; i < (ll)a2b2.size(); i++) res[i + n] += a2b2[i];
+		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];
 		return res;
 	}
 
 	bigint operator*(const bigint& v) const {
 		vll a(this->a.begin(), this->a.end());
 		vll b(v.a.begin(), v.a.end());
-		while (a.size() < b.size()) a.push_back(0);
-		while (b.size() < a.size()) b.push_back(0);
-		while (a.size() & (a.size() - 1))
+		while (sz(a) < sz(b)) a.push_back(0);
+		while (sz(b) < sz(a)) b.push_back(0);
+		while (sz(a) & (sz(a) - 1))
 			a.push_back(0), b.push_back(0);
 		vll c = karatsubaMultiply(a, b);
 		bigint res;
 		res.sign = sign * v.sign;
-		for (ll i = 0, carry = 0; i < (ll)c.size(); i++) {
+		for (ll i = 0, carry = 0; i < sz(c); i++) {
 			ll cur = c[i] + carry;
 			res.a.push_back(cur % base);
 			carry = cur / base;