test/cpv/library-checker-enumerative_combinatorics/factorial.fact_mint.mints-ms64.poly_nttmod-pntt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/factorial | ||
| 3 | #include "../../../src/math/fact/mod/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | CEXP u32 MOD = 998244353; | ||
| 7 | |||
| 8 | #include "../../../src/fps/ds/ntt/lib.hpp" | ||
| 9 | #include "../../../src/math/ds/mint/ms64/lib.hpp" | ||
| 10 | |||
| 11 | using namespace tifa_libs; | ||
| 12 | using mint = mint_ms64<MOD>; | ||
| 13 | using namespace tifa_libs; | ||
| 14 | using poly = polyntt<mint>; | ||
| 15 | |||
| 16 | 7 | int main() { | |
| 17 |
1/2✓ Branch 2 taken 7 times.
✗ Branch 3 not taken.
|
7 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 18 | u32 t; | ||
| 19 |
1/2✓ Branch 1 taken 7 times.
✗ Branch 2 not taken.
|
7 | std::cin >> t; |
| 20 |
2/2✓ Branch 0 taken 35 times.
✓ Branch 1 taken 7 times.
|
42 | while (t--) { |
| 21 | u64 n; | ||
| 22 |
1/2✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
|
35 | std::cin >> n; |
| 23 |
1/2✓ Branch 3 taken 35 times.
✗ Branch 4 not taken.
|
35 | std::cout << tifa_libs::fact_mint<poly>(n) << '\n'; |
| 24 | } | ||
| 25 | 7 | return 0; | |
| 26 | } | ||
| 27 |