GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 7 / 0 / 7
Functions: 100.0% 1 / 0 / 1
Branches: 50.0% 3 / 0 / 6

test/cpv/library-checker-other/sum_of_exponential_times_polynomial_limit.mints-ms.factorial-fact_helper.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sum_of_exponential_times_polynomial_limit
3 #include "../../../src/comb/seq/pows/lib.hpp"
4 #include "../../../src/math/ipaf/series/lib.hpp"
5
6 using namespace tifa_libs;
7 CEXP u32 MOD = 998244353;
8
9 #include "../../../src/math/ds/mint/ms/lib.hpp"
10 #include "../../../src/math/fact/helper/lib.hpp"
11
12 using namespace tifa_libs;
13 using mint = mint_ms<MOD>;
14 using namespace tifa_libs;
15 using fact_t = fact_helper<mint>;
16
17 10 int main() {
18
1/2
✓ Branch 2 taken 10 times.
✗ Branch 3 not taken.
10 std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
19 u32 r, d;
20
2/4
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 10 times.
✗ Branch 5 not taken.
10 std::cin >> r >> d;
21 10 auto p = tifa_libs::gen_pows<mint>(d + 1, d);
22 10 std::cout << tifa_libs::series_ipaf<mint, fact_t>(p, mint(r));
23 10 return 0;
24 10 }
25