GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 8 / 0 / 8
Functions: 100.0% 1 / 0 / 1
Branches: 60.0% 6 / 0 / 10

test/cpv/library-checker-enumerative_combinatorics/factorial.fhelper.mintd-bd.factorial-fact_helper.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/factorial
3 #include "../../../src/util/alias/num/lib.hpp"
4
5 using namespace tifa_libs;
6 CEXP u32 MOD = 998244353;
7
8 #include "../../../src/math/ds/mint/bd/lib.hpp"
9 #include "../../../src/math/fact/helper/lib.hpp"
10
11 using namespace tifa_libs;
12 using mint = mint_bd<__LINE__>;
13 using namespace tifa_libs;
14 using fact_t = fact_helper<mint>;
15
16 7 int main() {
17 7 mint::set_mod(MOD);
18
1/2
✓ Branch 2 taken 7 times.
✗ Branch 3 not taken.
7 std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
19 u32 t;
20
1/2
✓ Branch 1 taken 7 times.
✗ Branch 2 not taken.
7 std::cin >> t;
21
2/2
✓ Branch 0 taken 35 times.
✓ Branch 1 taken 7 times.
42 while (t--) {
22 u32 n;
23
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
35 std::cin >> n;
24
1/2
✓ Branch 3 taken 35 times.
✗ Branch 4 not taken.
35 std::cout << fact_t::get_fact(n) << '\n';
25 }
26 7 return 0;
27 }
28