GCC Code Coverage Report


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

test/cpv/library-checker-linear_algebra/matrix_det.mintd-md.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_det
3 #include "../../../src/lalg/ds/mat/lib.hpp"
4 #include "../../../src/lalg/mat/det/lib.hpp"
5 #include "../../../src/lalg/mat/ge/lib.hpp"
6
7 using namespace tifa_libs;
8 CEXP u32 MOD = 998244353;
9
10 #include "../../../src/math/ds/mint/md/lib.hpp"
11
12 using namespace tifa_libs;
13 using mint = mint_md<__LINE__>;
14 using mat = tifa_libs::matrix<mint>;
15
16 25 int main() {
17 25 mint::set_mod(MOD);
18
1/2
✓ Branch 2 taken 25 times.
✗ Branch 3 not taken.
25 std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
19 u32 n;
20
1/2
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
25 std::cin >> n;
21 25 mat a(n, n);
22 25 std::cin >> a;
23 1791333 auto is_0 = [](cT_(mint) x) { return x.val() == 0; };
24 25 auto ge = [&is_0](mat& m, bool f) { return tifa_libs::ge_mat(m, is_0, f); };
25
1/2
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
25 std::cout << det(a, ge);
26 25 return 0;
27 25 }
28