test/cpv/library-checker-enumerative_combinatorics/bell_number.mints-bs.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/bell_number | ||
| 3 | #include "../../../src/comb/seq/bell/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/bs/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_bs<MOD>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using poly = polyntt<mint>; | ||
| 17 | |||
| 18 | 11 | int main() { | |
| 19 | u32 n; | ||
| 20 | 11 | tifa_libs::fin_uint >> n; | |
| 21 | 11 | auto ans = tifa_libs::gen_bell<poly>(n); | |
| 22 |
2/2✓ Branch 3 taken 1511122 times.
✓ Branch 4 taken 11 times.
|
1511133 | flt_ (u32, i, 0, n + 1) tifa_libs::fout << ans[i] << " \n"[i == n]; |
| 23 | 11 | return 0; | |
| 24 | 11 | } | |
| 25 |