GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 12 / 0 / 12
Functions: 100.0% 2 / 0 / 2
Branches: 64.3% 9 / 0 / 14

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