From 1880ccb6d85c6eb79e724593457877bab431951c Mon Sep 17 00:00:00 2001
From: Gloria Mundi <gloria@gloria-mundi.eu>
Date: Sat, 16 Nov 2024 21:17:29 +0100
Subject: get rid of all() and sz()

---
 content/math/linearRecurrenceOld.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'content/math/linearRecurrenceOld.cpp')

diff --git a/content/math/linearRecurrenceOld.cpp b/content/math/linearRecurrenceOld.cpp
index 2501e64..f67398d 100644
--- a/content/math/linearRecurrenceOld.cpp
+++ b/content/math/linearRecurrenceOld.cpp
@@ -1,7 +1,7 @@
 constexpr ll mod = 1'000'000'007;
 vector<ll> modMul(const vector<ll>& a, const vector<ll>& b,
                   const vector<ll>& c) {
-	ll n = sz(c);
+	ll n = ssize(c);
 	vector<ll> res(n * 2 + 1);
 	for (int i = 0; i <= n; i++) { //a*b
 		for (int j = 0; j <= n; j++) {
@@ -18,8 +18,8 @@ vector<ll> modMul(const vector<ll>& a, const vector<ll>& b,
 }
 
 ll kthTerm(const vector<ll>& f, const vector<ll>& c, ll k) {
-	assert(sz(f) == sz(c));
-	vector<ll> tmp(sz(c) + 1), a(sz(c) + 1);
+	assert(ssize(f) == ssize(c));
+	vector<ll> tmp(ssize(c) + 1), a(ssize(c) + 1);
 	tmp[0] = a[1] = 1; //tmp = (x^k) % c
 
 	for (k++; k > 0; k /= 2) {
@@ -28,6 +28,6 @@ ll kthTerm(const vector<ll>& f, const vector<ll>& c, ll k) {
 	}
 
 	ll res = 0;
-	for (int i = 0; i < sz(c); i++) res += (tmp[i+1] * f[i]) % mod;
+	for (int i = 0; i < ssize(c); i++) res += (tmp[i+1] * f[i]) % mod;
 	return res % mod;
 }
-- 
cgit v1.2.3