test/cpv/library-checker-polynomial/division_of_polynomials.mints-bs.mints-bs.poly_anymod-p3ntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/division_of_polynomials | ||
| 3 | #include "../../../src/fps/divmod/lib.hpp" | ||
| 4 | #include "../../../src/io/fastin/lib.hpp" | ||
| 5 | #include "../../../src/io/fastout/lib.hpp" | ||
| 6 | |||
| 7 | using namespace tifa_libs; | ||
| 8 | CEXP u32 MOD = 998244353; | ||
| 9 | |||
| 10 | #include "../../../src/fps/ds/ntt3/lib.hpp" | ||
| 11 | #include "../../../src/math/ds/mint/bs/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_bs<MOD>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using mint_p3ntt1 = mint_bs<167772161>; | ||
| 17 | using mint_p3ntt2 = mint_bs<469762049>; | ||
| 18 | using mint_p3ntt3 = mint_bs<754974721>; | ||
| 19 | using poly = poly3ntt<mint, mint_p3ntt1, mint_p3ntt2, mint_p3ntt3>; | ||
| 20 | |||
| 21 | 35 | int main() { | |
| 22 | u32 n, m; | ||
| 23 | 35 | tifa_libs::fin_uint >> n >> m; | |
| 24 | 35 | poly f(n), g(m); | |
| 25 | 35 | tifa_libs::fin_uint >> f >> g; | |
| 26 | 35 | auto [q, r] = tifa_libs::divmod_fps(f, g); | |
| 27 |
7/8✓ Branch 1 taken 9 times.
✓ Branch 2 taken 26 times.
✓ Branch 5 taken 7 times.
✓ Branch 6 taken 2 times.
✓ Branch 7 taken 7 times.
✓ Branch 8 taken 28 times.
✓ Branch 10 taken 7 times.
✗ Branch 11 not taken.
|
35 | if (q.size() == 1 && q[0].val() == 0) q.resize(0); |
| 28 |
7/8✓ Branch 1 taken 6 times.
✓ Branch 2 taken 29 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 3 times.
✓ Branch 7 taken 3 times.
✓ Branch 8 taken 32 times.
✓ Branch 10 taken 3 times.
✗ Branch 11 not taken.
|
35 | if (r.size() == 1 && r[0].val() == 0) r.resize(0); |
| 29 | 35 | tifa_libs::fout << q.size() << ' ' << r.size() << '\n'; | |
| 30 | 35 | tifa_libs::fout << q << '\n'; | |
| 31 | 35 | tifa_libs::fout << r << '\n'; | |
| 32 | 35 | return 0; | |
| 33 | 35 | } | |
| 34 |