GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 9 / 0 / 9
Functions: 100.0% 1 / 0 / 1
Branches: 75.0% 3 / 0 / 4

test/cpv/library-checker-set_power_series/polynomial_composite_set_power_series.mints-bs.poly_nttmod-pntt.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_composite_set_power_series
3 #include "../../../src/io/container/lib.hpp"
4 #include "../../../src/io/fastin/lib.hpp"
5 #include "../../../src/io/fastout/lib.hpp"
6 #include "../../../src/sps/comp/lib.hpp"
7
8 using namespace tifa_libs;
9 CEXP u32 MOD = 998244353;
10
11 #include "../../../src/fps/ds/ntt/lib.hpp"
12 #include "../../../src/math/ds/mint/bs/lib.hpp"
13
14 using namespace tifa_libs;
15 using mint = mint_bs<MOD>;
16 using namespace tifa_libs;
17 using poly = polyntt<mint>;
18
19 18 int main() {
20 u32 m, n;
21 18 tifa_libs::fin_uint >> m >> n;
22 18 poly a(m);
23 18 tifa_libs::fin_uint >> a;
24
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
18 vec<mint> b(1 << n);
25
2/2
✓ Branch 6 taken 4597553 times.
✓ Branch 7 taken 18 times.
4597571 for (auto& i : b) tifa_libs::fin_uint >> i;
26 18 tifa_libs::fout << tifa_libs::comp_fpssps(n, a, b) << '\n';
27 18 return 0;
28 18 }
29