test/cpv/library-checker-polynomial/multipoint_evaluation_on_geometric_sequence.mintd-md.poly_anymod-pmtt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence | ||
| 3 | #include "../../../src/fps/czt/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/md/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_md<__LINE__>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using poly = polymtt<mint>; | ||
| 17 | |||
| 18 | 25 | int main() { | |
| 19 | 25 | mint::set_mod(MOD); | |
| 20 | u32 n, m; | ||
| 21 | 25 | mint a, r; | |
| 22 | 25 | tifa_libs::fin_uint >> n >> m >> a >> r; | |
| 23 | 25 | poly f(n); | |
| 24 | 25 | tifa_libs::fin_uint >> f; | |
| 25 |
1/2✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
|
25 | tifa_libs::fout << tifa_libs::czt_fps(f, r, m, a) << '\n'; |
| 26 | 25 | return 0; | |
| 27 | 25 | } | |
| 28 |