summaryrefslogtreecommitdiff
path: root/math/transforms/seriesOperations.cpp
diff options
context:
space:
mode:
authorMZuenni <michi.zuendorf@gmail.com>2024-06-28 13:47:18 +0200
committerMZuenni <michi.zuendorf@gmail.com>2024-06-28 13:47:18 +0200
commit65d2ac37862ce9d1de208a05099c281863e66256 (patch)
treed1fe1ece8790e8e8b2a8bcd3895f82477b3a0e2b /math/transforms/seriesOperations.cpp
parenta3c9198048cf465a3c01827b3667edfc99d8031c (diff)
parent366ff0a4ba0c94f5cdc2cbd4e2c991ad0b544522 (diff)
merge
Diffstat (limited to 'math/transforms/seriesOperations.cpp')
-rw-r--r--math/transforms/seriesOperations.cpp56
1 files changed, 56 insertions, 0 deletions
diff --git a/math/transforms/seriesOperations.cpp b/math/transforms/seriesOperations.cpp
new file mode 100644
index 0000000..4743674
--- /dev/null
+++ b/math/transforms/seriesOperations.cpp
@@ -0,0 +1,56 @@
+vector<ll> poly_inv(const vector<ll>& a, int n) {
+ vector<ll> q = {powMod(a[0], mod-2, mod)};
+ for (int len = 1; len < n; len *= 2){
+ vector<ll> a2 = a, q2 = q;
+ a2.resize(2*len), q2.resize(2*len);
+ ntt(q2);
+ for (int j : {0, 1}) {
+ ntt(a2);
+ for (int i = 0; i < 2*len; i++) a2[i] = a2[i]*q2[i] % mod;
+ ntt(a2, true);
+ for (int i = 0; i < len; i++) a2[i] = 0;
+ }
+ for (int i = len; i < min(n, 2*len); i++) {
+ q.push_back((mod - a2[i]) % mod);
+ }}
+ return q;
+}
+
+vector<ll> poly_deriv(vector<ll> a) {
+ for (int i = 1; i < sz(a); i++)
+ a[i-1] = a[i] * i % mod;
+ a.pop_back();
+ return a;
+}
+
+vector<ll> poly_integr(vector<ll> a) {
+ if (a.empty()) return {0};
+ a.push_back(a.back() * powMod(sz(a), mod-2, mod) % mod);
+ for (int i = sz(a)-2; i > 0; i--)
+ a[i] = a[i-1] * powMod(i, mod-2, mod) % mod;
+ a[0] = 0;
+ return a;
+}
+
+vector<ll> poly_log(vector<ll> a, int n) {
+ a = mul(poly_deriv(a), poly_inv(a, n));
+ a.resize(n-1);
+ a = poly_integr(a);
+ return a;
+}
+
+vector<ll> poly_exp(vector<ll> a, int n) {
+ vector<ll> q = {1};
+ for (int len = 1; len < n; len *= 2) {
+ vector<ll> p = poly_log(q, 2*len);
+ for (int i = 0; i < 2*len; i++)
+ p[i] = (mod - p[i] + (i < sz(a) ? a[i] : 0)) % mod;
+ vector<ll> q2 = q;
+ q2.resize(2*len);
+ ntt(p), ntt(q2);
+ for (int i = 0; i < 2*len; i++) p[i] = p[i] * q2[i] % mod;
+ ntt(p, true);
+ for (int i = len; i < min(n, 2*len); i++) q.push_back(p[i]);
+ }
+ return q;
+}