test/cpv/library-checker-enumerative_combinatorics/sharp_p_subset_sum.mints-ms.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sharp_p_subset_sum | ||
| 3 | #include "../../../src/io/container/lib.hpp" | ||
| 4 | #include "../../../src/io/fastin/lib.hpp" | ||
| 5 | #include "../../../src/io/fastout/lib.hpp" | ||
| 6 | #include "../../../src/math/ssts_pim_cnt/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/ms/lib.hpp" | ||
| 13 | |||
| 14 | using namespace tifa_libs; | ||
| 15 | using mint = mint_ms<MOD>; | ||
| 16 | using namespace tifa_libs; | ||
| 17 | using poly = polyntt<mint>; | ||
| 18 | |||
| 19 | 24 | int main() { | |
| 20 | u32 n, t; | ||
| 21 | 24 | tifa_libs::fin_uint >> n >> t; | |
| 22 |
1/2✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
|
24 | vecu s(n); |
| 23 | 24 | tifa_libs::fin_uint >> s; | |
| 24 | 24 | auto v = tifa_libs::ssts_pim_cnt<poly>(s, t); | |
| 25 |
2/2✓ Branch 3 taken 7835908 times.
✓ Branch 4 taken 24 times.
|
7835932 | flt_ (u32, i, 1, t + 1) tifa_libs::fout << v[i] << " \n"[i == t]; |
| 26 | 24 | return 0; | |
| 27 | 24 | } | |
| 28 |