Exp of Power Series (Sparse) (verify/poly/sparse/exp.test.cpp)

• View this file on GitHub
• Last update: 2026-09-10 02:45:56+02:00
• Problem: https://judge.yosupo.jp/problem/exp_of_formal_power_series_sparse

Depends on

• cp-algo/math/combinatorics.hpp
• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/dft.hpp
• cp-algo/math/fft.hpp
• cp-algo/math/poly/base.hpp
• cp-algo/math/poly/sparse/exp.hpp
• cp-algo/math/poly/sparse/impl.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/checkpoint.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Exp of Power Series (Sparse)
#define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series_sparse"
#define CP_ALGO_MAXN (1 << 20)
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/poly/sparse/exp.hpp"
using namespace std;
using namespace cp_algo::math;
using base = modint<998244353>;
using polyn = poly_t<base>;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k;
    cin >> n >> k;
    polyn::Vector a(n);
    for(int j = 0; j < k; j++) {
        int i;
        cin >> i;
        cin >> a[i];
    }
    exp_sparse(polyn(std::move(a)), n).print(n);
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 290, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus.py", line 243, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus_bundle.py", line 322, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	12 ms	10 MB
g++	example_01	AC	12 ms	10 MB
g++	example_02	AC	12 ms	10 MB
g++	max_random_00	AC	33 ms	18 MB
g++	max_random_01	AC	33 ms	18 MB
g++	max_random_02	AC	32 ms	18 MB
g++	max_random_03	AC	33 ms	18 MB
g++	max_random_04	AC	31 ms	18 MB
g++	min_K_00	AC	20 ms	13 MB
g++	min_K_01	AC	21 ms	13 MB
g++	random_00	AC	20 ms	13 MB
g++	random_01	AC	22 ms	13 MB
g++	random_02	AC	24 ms	14 MB
g++	random_03	AC	20 ms	13 MB
g++	random_04	AC	26 ms	16 MB
g++	small_N_00	AC	12 ms	10 MB
g++	small_N_01	AC	12 ms	10 MB
g++	small_N_02	AC	11 ms	10 MB
g++	small_N_03	AC	2 ms	6 MB
g++	small_N_04	AC	11 ms	10 MB
g++	small_dense_00	AC	51 ms	26 MB
g++	small_dense_01	AC	49 ms	26 MB
g++	small_dense_02	AC	53 ms	26 MB
g++	small_dense_03	AC	36 ms	18 MB
g++	small_dense_04	AC	51 ms	26 MB

Back to top page