diff options
| author | mzuenni <mzuenni@users.noreply.github.com> | 2024-07-28 22:54:40 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-07-28 22:54:40 +0200 |
| commit | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch) | |
| tree | 96d75baff33d5a04b5a60f1a41f514a26c716874 /math/berlekampMassey.cpp | |
| parent | 8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (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/berlekampMassey.cpp')
| -rw-r--r-- | math/berlekampMassey.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/math/berlekampMassey.cpp b/math/berlekampMassey.cpp deleted file mode 100644 index 29e084f..0000000 --- a/math/berlekampMassey.cpp +++ /dev/null @@ -1,31 +0,0 @@ -constexpr ll mod = 1'000'000'007; -vector<ll> BerlekampMassey(const vector<ll>& s) { - int n = sz(s), L = 0, m = 0; - vector<ll> C(n), B(n), T; - C[0] = B[0] = 1; - - ll b = 1; - for (int i = 0; i < n; i++) { - m++; - ll d = s[i] % mod; - for (int j = 1; j <= L; j++) { - d = (d + C[j] * s[i - j]) % mod; - } - if (!d) continue; - T = C; - ll coef = d * powMod(b, mod-2, mod) % mod; - for (int j = m; j < n; j++) { - C[j] = (C[j] - coef * B[j - m]) % mod; - } - if (2 * L > i) continue; - L = i + 1 - L; - swap(B, T); - b = d; - m = 0; - } - - C.resize(L + 1); - C.erase(C.begin()); - for (auto& x : C) x = (mod - x) % mod; - return C; -} |