GCC Code Coverage Report


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

test/cpv/library-checker-polynomial/pow_of_formal_power_series_sparse.mints-bs.mints-bs.poly_anymod-p3ntt.cpp
Line Branch Exec Source
1 #define AUTO_GENERATED
2 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_formal_power_series_sparse
3 #include "../../../src/fpssp/pow/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/bs/lib.hpp"
12
13 using namespace tifa_libs;
14 using mint = mint_bs<MOD>;
15 using namespace tifa_libs;
16 using mint_p3ntt1 = mint_bs<167772161>;
17 using mint_p3ntt2 = mint_bs<469762049>;
18 using mint_p3ntt3 = mint_bs<754974721>;
19 using poly = poly3ntt<mint, mint_p3ntt1, mint_p3ntt2, mint_p3ntt3>;
20
21 35 int main() {
22 u32 n, k;
23 u64 m;
24 35 tifa_libs::fin_uint >> n >> k >> m;
25 35 poly p(n);
26
2/2
✓ Branch 3 taken 191 times.
✓ Branch 4 taken 35 times.
226 for (u32 i = 0, x; i < k; ++i) tifa_libs::fin_uint >> x >> p[x];
27 35 tifa_libs::fout << tifa_libs::pow_fpssp(p, m);
28 35 return 0;
29 35 }
30