Lazy FPS: Exp of Power Series (verify/fps/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

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/fps.hpp
• cp-algo/math/poly/base.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 Lazy FPS: Exp of Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/fps.hpp"

using namespace std;
using namespace cp_algo::math;

const int mod = 998244353;
using base = modint<mod>;
using polyn = poly_t<base>;

void solve() {
    int n;
    cin >> n;
    polyn::Vector a(n);
    for(auto &it: a) {cin >> it;}
    exp(fps<base>(polyn(std::move(a)))).prefix(n).print(n);
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    while(t--) {
        solve();
    }
}

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	7 ms	8 MB
g++	max_all_zero_00	AC	28 ms	17 MB
g++	max_ans_zero_00	AC	217 ms	42 MB
g++	max_random_00	AC	217 ms	42 MB
g++	max_random_01	AC	218 ms	42 MB
g++	max_random_02	AC	221 ms	42 MB
g++	max_random_03	AC	220 ms	42 MB
g++	max_random_04	AC	218 ms	42 MB
g++	near_262144_00	AC	113 ms	24 MB
g++	near_262144_01	AC	114 ms	24 MB
g++	near_262144_02	AC	126 ms	39 MB
g++	random_00	AC	171 ms	40 MB
g++	random_01	AC	205 ms	41 MB
g++	random_02	AC	29 ms	11 MB
g++	random_03	AC	194 ms	41 MB
g++	random_04	AC	132 ms	39 MB
g++	small_degree_00	AC	2 ms	6 MB
g++	small_degree_01	AC	7 ms	8 MB
g++	small_degree_02	AC	6 ms	8 MB
g++	small_degree_03	AC	6 ms	8 MB
g++	small_degree_04	AC	6 ms	8 MB
g++	small_degree_05	AC	7 ms	8 MB
g++	small_degree_06	AC	6 ms	8 MB
g++	small_degree_07	AC	7 ms	8 MB
g++	small_degree_08	AC	6 ms	8 MB
g++	small_degree_09	AC	6 ms	8 MB

Back to top page