GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 13 / 0 / 13
Functions: 100.0% 1 / 0 / 1
Branches: 87.5% 14 / 0 / 16

test/cpv/library-checker-polynomial/division_of_polynomials.mintd-bd.mints-ms.poly_anymod-p3ntt.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/division_of_polynomials
3 #include "../../../src/fps/divmod/lib.hpp"
4 #include "../../../src/io/fastin/lib.hpp"
5 #include "../../../src/io/fastout/lib.hpp"
6
7 using namespace tifa_libs;
8 CEXP u32 MOD = 998244353;
9
10 #include "../../../src/fps/ds/ntt3/lib.hpp"
11 #include "../../../src/math/ds/mint/bd/lib.hpp"
12 #include "../../../src/math/ds/mint/ms/lib.hpp"
13
14 using namespace tifa_libs;
15 using mint = mint_bd<__LINE__>;
16 using namespace tifa_libs;
17 using mint_p3ntt1 = mint_ms<167772161>;
18 using mint_p3ntt2 = mint_ms<469762049>;
19 using mint_p3ntt3 = mint_ms<754974721>;
20 using poly = poly3ntt<mint, mint_p3ntt1, mint_p3ntt2, mint_p3ntt3>;
21
22 35 int main() {
23 35 mint::set_mod(MOD);
24 u32 n, m;
25 35 tifa_libs::fin_uint >> n >> m;
26 35 poly f(n), g(m);
27 35 tifa_libs::fin_uint >> f >> g;
28 35 auto [q, r] = tifa_libs::divmod_fps(f, g);
29
7/8
✓ Branch 1 taken 9 times.
✓ Branch 2 taken 26 times.
✓ Branch 5 taken 7 times.
✓ Branch 6 taken 2 times.
✓ Branch 7 taken 7 times.
✓ Branch 8 taken 28 times.
✓ Branch 10 taken 7 times.
✗ Branch 11 not taken.
35 if (q.size() == 1 && q[0].val() == 0) q.resize(0);
30
7/8
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 29 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 3 times.
✓ Branch 7 taken 3 times.
✓ Branch 8 taken 32 times.
✓ Branch 10 taken 3 times.
✗ Branch 11 not taken.
35 if (r.size() == 1 && r[0].val() == 0) r.resize(0);
31 35 tifa_libs::fout << q.size() << ' ' << r.size() << '\n';
32 35 tifa_libs::fout << q << '\n';
33 35 tifa_libs::fout << r << '\n';
34 35 return 0;
35 35 }
36