test/cpv/library-checker-polynomial/inv_of_polynomials.mintd-bd.mints-ms64.poly_anymod-p3ntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inv_of_polynomials | ||
| 3 | #include "../../../src/fps/modinv/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/bd/lib.hpp" | ||
| 12 | #include "../../../src/math/ds/mint/ms64/lib.hpp" | ||
| 13 | |||
| 14 | using namespace tifa_libs; | ||
| 15 | using mint = mint_bd<__LINE__>; | ||
| 16 | using namespace tifa_libs; | ||
| 17 | using mint_p3ntt1 = mint_ms64<167772161>; | ||
| 18 | using mint_p3ntt2 = mint_ms64<469762049>; | ||
| 19 | using mint_p3ntt3 = mint_ms64<754974721>; | ||
| 20 | using poly = poly3ntt<mint, mint_p3ntt1, mint_p3ntt2, mint_p3ntt3>; | ||
| 21 | |||
| 22 | 18 | int main() { | |
| 23 | 18 | mint::set_mod(MOD); | |
| 24 | u32 n, m; | ||
| 25 | 18 | tifa_libs::fin_uint >> n >> m; | |
| 26 | 18 | poly a(n), b(m); | |
| 27 | 18 | tifa_libs::fin_uint >> a >> b; | |
| 28 | 18 | auto _ = tifa_libs::modinv_fps(a, b); | |
| 29 |
2/2✓ Branch 1 taken 1 time.
✓ Branch 2 taken 17 times.
|
18 | if (!_) tifa_libs::fout << "-1\n"; |
| 30 |
2/2✓ Branch 2 taken 1 time.
✓ Branch 3 taken 16 times.
|
17 | else if (_->is_zero()) tifa_libs::fout << "0\n"; |
| 31 | 16 | else tifa_libs::fout << _->size() << '\n' | |
| 32 |
1/2✓ Branch 2 taken 16 times.
✗ Branch 3 not taken.
|
16 | << _.value() << '\n'; |
| 33 | 18 | return 0; | |
| 34 | 18 | } | |
| 35 |