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/linearRecurrence.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

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

diff --git a/content/math/linearRecurrence.cpp b/content/math/linearRecurrence.cpp
index a8adacd..eb04566 100644
--- a/content/math/linearRecurrence.cpp
+++ b/content/math/linearRecurrence.cpp
@@ -1,9 +1,9 @@
 constexpr ll mod = 998244353;
 // oder ntt mul @\sourceref{math/transforms/ntt.cpp}@
 vector<ll> mul(const vector<ll>& a, const vector<ll>& b) {
-	vector<ll> c(sz(a) + sz(b) - 1);
-	for (int i = 0; i < sz(a); i++) {
-		for (int j = 0; j < sz(b); j++) {
+	vector<ll> c(ssize(a) + ssize(b) - 1);
+	for (int i = 0; i < ssize(a); i++) {
+		for (int j = 0; j < ssize(b); j++) {
 			c[i+j] += a[i]*b[j] % mod;
 	}}
 	for (ll& x : c) x %= mod;
@@ -11,7 +11,7 @@ vector<ll> mul(const vector<ll>& a, const vector<ll>& b) {
 }
 
 ll kthTerm(const vector<ll>& f, const vector<ll>& c, ll k) {
-	int n = sz(c);
+	int n = ssize(c);
 	vector<ll> q(n + 1, 1);
 	for (int i = 0; i < n; i++) q[i + 1] = (mod - c[i]) % mod;
 	vector<ll> p = mul(f, q);
-- 
cgit v1.2.3