test/cpv/library-checker-polynomial/log_of_formal_power_series_sparse.mintd-bd.mints-ms.poly_anymod-p3ntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/log_of_formal_power_series_sparse | ||
| 3 | #include "../../../src/fpssp/ln/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/ms/lib.hpp" | ||
| 13 | |||
| 14 | using namespace tifa_libs; | ||
| 15 | using mint = mint_bd<__LINE__>; | ||
| 16 | using namespace tifa_libs; | ||
| 17 | using mint_p3ntt1 = mint_ms<167772161>; | ||
| 18 | using mint_p3ntt2 = mint_ms<469762049>; | ||
| 19 | using mint_p3ntt3 = mint_ms<754974721>; | ||
| 20 | using poly = poly3ntt<mint, mint_p3ntt1, mint_p3ntt2, mint_p3ntt3>; | ||
| 21 | |||
| 22 | 24 | int main() { | |
| 23 | 24 | mint::set_mod(MOD); | |
| 24 | u32 n, k; | ||
| 25 | 24 | tifa_libs::fin_uint >> n >> k; | |
| 26 | 24 | poly p(n); | |
| 27 |
2/2✓ Branch 3 taken 111 times.
✓ Branch 4 taken 24 times.
|
135 | for (u32 i = 0, x; i < k; ++i) tifa_libs::fin_uint >> x >> p[x]; |
| 28 | 24 | tifa_libs::fout << tifa_libs::ln_fpssp(p); | |
| 29 | 24 | return 0; | |
| 30 | 24 | } | |
| 31 |