test/cpv/library-checker-other/sum_of_exponential_times_polynomial.mintd-bd.poly_anymod-pmtt.factorial-factl_helper.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sum_of_exponential_times_polynomial | ||
| 3 | #include "../../../src/comb/seq/pows/lib.hpp" | ||
| 4 | #include "../../../src/math/ipaf/sum/lib.hpp" | ||
| 5 | |||
| 6 | using namespace tifa_libs; | ||
| 7 | CEXP u32 MOD = 998244353; | ||
| 8 | |||
| 9 | #include "../../../src/fps/ds/mtt/lib.hpp" | ||
| 10 | #include "../../../src/math/ds/mint/bd/lib.hpp" | ||
| 11 | #include "../../../src/math/fact/helper_l/lib.hpp" | ||
| 12 | |||
| 13 | using namespace tifa_libs; | ||
| 14 | using mint = mint_bd<__LINE__>; | ||
| 15 | using namespace tifa_libs; | ||
| 16 | using poly = polymtt<mint>; | ||
| 17 | using namespace tifa_libs; | ||
| 18 | using fact_t = factl_helper<poly>; | ||
| 19 | |||
| 20 | 20 | int main() { | |
| 21 | 20 | mint::set_mod(MOD); | |
| 22 |
1/2✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
|
20 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 23 | u32 r, d; | ||
| 24 | u64 n; | ||
| 25 |
3/6✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 20 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 20 times.
✗ Branch 8 not taken.
|
20 | std::cin >> r >> d >> n; |
| 26 | 20 | auto p = tifa_libs::gen_pows<mint>(d + 1, d); | |
| 27 | 20 | std::cout << tifa_libs::sum_ipaf<mint, fact_t>(p, mint(r), n); | |
| 28 | 20 | return 0; | |
| 29 | 20 | } | |
| 30 |