test/cpv/library-checker-polynomial/sqrt_of_formal_power_series.mints-ms.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sqrt_of_formal_power_series | ||
| 3 | #include "../../../src/fps/sqrt/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/ntt/lib.hpp" | ||
| 11 | #include "../../../src/math/ds/mint/ms/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_ms<MOD>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using poly = polyntt<mint>; | ||
| 17 | |||
| 18 | 35 | int main() { | |
| 19 | u32 n; | ||
| 20 | 35 | tifa_libs::fin_uint >> n; | |
| 21 | 35 | poly p(n); | |
| 22 | 35 | tifa_libs::fin_uint >> p; | |
| 23 |
1/2✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
|
35 | auto res = tifa_libs::sqrt_fps(p); |
| 24 |
2/2✓ Branch 1 taken 16 times.
✓ Branch 2 taken 19 times.
|
35 | if (!res) tifa_libs::fout << "-1\n"; |
| 25 |
1/2✓ Branch 1 taken 19 times.
✗ Branch 2 not taken.
|
19 | else tifa_libs::fout << res.value() << '\n'; |
| 26 | 35 | return 0; | |
| 27 | 35 | } | |
| 28 |