test/cpv/library-checker-polynomial/conversion_from_monomial_basis_to_newton_basis.mints-bs.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/conversion_from_monomial_basis_to_newton_basis | ||
| 3 | #include "../../../src/fps/cbm2n/lib.hpp" | ||
| 4 | #include "../../../src/io/container/lib.hpp" | ||
| 5 | #include "../../../src/io/fastin/lib.hpp" | ||
| 6 | #include "../../../src/io/fastout/lib.hpp" | ||
| 7 | |||
| 8 | using namespace tifa_libs; | ||
| 9 | CEXP u32 MOD = 998244353; | ||
| 10 | |||
| 11 | #include "../../../src/fps/ds/ntt/lib.hpp" | ||
| 12 | #include "../../../src/math/ds/mint/bs/lib.hpp" | ||
| 13 | |||
| 14 | using namespace tifa_libs; | ||
| 15 | using mint = mint_bs<MOD>; | ||
| 16 | using namespace tifa_libs; | ||
| 17 | using poly = polyntt<mint>; | ||
| 18 | |||
| 19 | 15 | int main() { | |
| 20 | u32 n; | ||
| 21 | 15 | tifa_libs::fin_uint >> n; | |
| 22 | 15 | poly f(n); | |
| 23 |
1/2✓ Branch 1 taken 15 times.
✗ Branch 2 not taken.
|
15 | vec<mint> p(n); |
| 24 | 15 | tifa_libs::fin_uint >> f >> p; | |
| 25 | 15 | tifa_libs::fout << tifa_libs::cbm2n_fps(f, p) << '\n'; | |
| 26 | 15 | return 0; | |
| 27 | 15 | } | |
| 28 |