test/cpv/library-checker-polynomial/shift_of_sampling_points_of_polynomial.mints-ms.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial | ||
| 3 | #include "../../../src/fps/ctsh/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 | 32 | int main() { | |
| 19 | u32 n, m, c; | ||
| 20 | 32 | tifa_libs::fin_uint >> n >> m >> c; | |
| 21 | 32 | poly a(n); | |
| 22 | 32 | tifa_libs::fin_uint >> a; | |
| 23 | 32 | tifa_libs::fout << tifa_libs::ctsh_fps(a, mint(c), m) << '\n'; | |
| 24 | 32 | return 0; | |
| 25 | 32 | } | |
| 26 |