test/cpv/library-checker-polynomial/log_of_formal_power_series_sparse.mints-ms64.poly_anymod-pmtt.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/mtt/lib.hpp" | ||
| 11 | #include "../../../src/math/ds/mint/ms64/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_ms64<MOD>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using poly = polymtt<mint>; | ||
| 17 | |||
| 18 | 24 | int main() { | |
| 19 | u32 n, k; | ||
| 20 | 24 | tifa_libs::fin_uint >> n >> k; | |
| 21 | 24 | poly p(n); | |
| 22 |
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]; |
| 23 | 24 | tifa_libs::fout << tifa_libs::ln_fpssp(p); | |
| 24 | 24 | return 0; | |
| 25 | 24 | } | |
| 26 |