From 36fa19a38cf9a357f04d4ed76f25b1cbf44deedb Mon Sep 17 00:00:00 2001
From: Lucas Schwebler <lucas.schwebler@gmail.com>
Date: Tue, 10 Sep 2024 21:50:42 +0200
Subject: new linear recurrence kthTerm code

---
 content/math/linearRecurrence.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 content/math/linearRecurrence.cpp

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

diff --git a/content/math/linearRecurrence.cpp b/content/math/linearRecurrence.cpp
new file mode 100644
index 0000000..c15c25c
--- /dev/null
+++ b/content/math/linearRecurrence.cpp
@@ -0,0 +1,30 @@
+// constexpr ll mod = 998244353;
+// 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++){
+// 			c[i+j] += a[i]*b[j] % mod;
+// 		}
+// 	}
+// 	for(ll &x : c) x %= mod;
+// 	return c;
+// }
+
+ll kthTerm(const vector<ll>& f, const vector<ll>& c, ll k){
+	int n = sz(c);
+	vector<ll> q(n+1, 1);
+	for(int i = 1; i <= n; i++) q[i] = (mod-c[i-1])%mod;
+	vector<ll> p = mul(f, q);
+	p.resize(n);
+	p.push_back(0);
+	do{
+		vector<ll> q2 = q;
+		for(int i = 1; i <= n; i += 2) q2[i] = (mod - q2[i]) % mod;
+		vector<ll> x = mul(p, q2), y = mul(q, q2);
+		for(int i = 0; i <= n; i++){
+			p[i] = i == n ? 0 : x[2*i + (k&1)];
+			q[i] = y[2*i];
+		}
+	}while(k /= 2);
+	return p[0];
+}
\ No newline at end of file
-- 
cgit v1.2.3