summaryrefslogtreecommitdiff
path: root/math/transforms/seriesOperations.cpp
diff options
context:
space:
mode:
authormzuenni <mzuenni@users.noreply.github.com>2024-07-28 22:54:40 +0200
committerGitHub <noreply@github.com>2024-07-28 22:54:40 +0200
commit8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch)
tree96d75baff33d5a04b5a60f1a41f514a26c716874 /math/transforms/seriesOperations.cpp
parent8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (diff)
Test (#4)
* update * moved content in subdir * rename file * add test setup * add test setup * add github action * automaticly test all cpp files * timeout after 10s * setulimit and dont zero memory * test build pdf * install latexmk * update * update * ngerman * fonts * removed old code * add first test * added tests * test in sorted order * more tests * simplified test * more tests * fix suffix tree * fixes and improvements * done ust lst directly * fix swap * add links to pdf * fix constants * add primorial * add comment * various improvements * more tests * added missing stuf * more tests * fix tests * more tests * more tests * more tests * fix recursion? * test trie * more tests * only use python temporarily for listings * only use python temporarily for listings * more tests * fix longestCommonSubstring * more tests * more tests * made code more similiar * fix? * more tests * more tests * more tests * add ahoCorasick test + limit 4GB stack size * more tests * fix test * add additional test * more tests * more tests * fix? * better fix * fix virtual tree * more tests * more tests * recursive closest pair * more tests * decrease limit * new tests * more tests * fix name * more tests * add test * new test * more tests * more tests * more tests * more tests * new test and content * new code * new code * larger tests * fix and test * new test * new test * update pdf * remove comments * new test * more tests * more testcases * more tests * increased limit * more tests * more tests * more tests * new tests * more tests * shortened code * new test * add basic tests for bigint * more tests * removed old files * new test * ignore some files * more auto more ccw * fix test * more tests * fix * new tests * more tests * more tests * stronger test * actually verify delaunay... * more tests * fix header * more tests * run tests parallel? * test parralel? * add --missing * separate workflows * test * is the pdf checked? * separate workflows * fix workflow * more workflows --------- Co-authored-by: Yidi <noob999noob999@gmail.com>
Diffstat (limited to 'math/transforms/seriesOperations.cpp')
-rw-r--r--math/transforms/seriesOperations.cpp56
1 files changed, 0 insertions, 56 deletions
diff --git a/math/transforms/seriesOperations.cpp b/math/transforms/seriesOperations.cpp
deleted file mode 100644
index 4743674..0000000
--- a/math/transforms/seriesOperations.cpp
+++ /dev/null
@@ -1,56 +0,0 @@
-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;
-}