diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /math/chineseRemainder.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'math/chineseRemainder.cpp')
| -rw-r--r-- | math/chineseRemainder.cpp | 14 |
1 files changed, 0 insertions, 14 deletions
diff --git a/math/chineseRemainder.cpp b/math/chineseRemainder.cpp deleted file mode 100644 index ccbc5dc..0000000 --- a/math/chineseRemainder.cpp +++ /dev/null @@ -1,14 +0,0 @@ -struct CRT { - using lll = __int128; - lll M = 1, sol = 0; // Solution unique modulo M - bool hasSol = true; - - // Adds congruence x = a (mod m) - void add(ll a, ll m) { - auto [d, s, t] = extendedEuclid(M, m); - if((a - sol) % d != 0) hasSol = false; - lll z = M/d * s; - M *= m/d; - sol = (z % M * (a-sol) % M + sol + M) % M; - } -}; |
