GCC Code Coverage Report


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

test/cpv/library-checker-other/find_linear_recurrence.mints-ms.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/find_linear_recurrence
3 #include "../../../src/io/container/lib.hpp"
4 #include "../../../src/math/lrec/berlekamp_massey/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
14 18 int main() {
15
1/2
✓ Branch 2 taken 18 times.
✗ Branch 3 not taken.
18 std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
16 u32 n;
17
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
18 std::cin >> n;
18
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
18 vec<mint> a(n);
19 18 std::cin >> a;
20 18 auto b = tifa_libs::berlekamp_massey(a);
21
2/4
✓ Branch 2 taken 18 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 18 times.
✗ Branch 6 not taken.
18 std::cout << b.size() - 1 << '\n';
22
3/4
✓ Branch 6 taken 60586 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 60586 times.
✓ Branch 9 taken 18 times.
60604 flt_ (u32, i, 1, (u32)b.size()) std::cout << -b[i] << " \n"[i + 1 == b.size()];
23 18 return 0;
24 18 }
25