CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Exp of Power Series (verify/poly/exp.test.cpp)

Depends on

Code

// @brief Exp of Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/math/poly.hpp"
#include <bits/stdc++.h>

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);
    copy_n(istream_iterator<base>(cin), n, begin(a));
    polyn(a).exp_inplace(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_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 14 ms 10 MB
g++ max_all_zero_00 :heavy_check_mark: AC 46 ms 7 MB
g++ max_ans_zero_00 :heavy_check_mark: AC 380 ms 61 MB
g++ max_random_00 :heavy_check_mark: AC 370 ms 64 MB
g++ max_random_01 :heavy_check_mark: AC 363 ms 64 MB
g++ max_random_02 :heavy_check_mark: AC 369 ms 64 MB
g++ max_random_03 :heavy_check_mark: AC 361 ms 64 MB
g++ max_random_04 :heavy_check_mark: AC 361 ms 64 MB
g++ near_262144_00 :heavy_check_mark: AC 189 ms 42 MB
g++ near_262144_01 :heavy_check_mark: AC 190 ms 40 MB
g++ near_262144_02 :heavy_check_mark: AC 315 ms 60 MB
g++ random_00 :heavy_check_mark: AC 344 ms 60 MB
g++ random_01 :heavy_check_mark: AC 359 ms 64 MB
g++ random_02 :heavy_check_mark: AC 51 ms 19 MB
g++ random_03 :heavy_check_mark: AC 346 ms 63 MB
g++ random_04 :heavy_check_mark: AC 318 ms 60 MB
g++ small_degree_00 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_01 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_02 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_03 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_04 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_05 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_06 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_07 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_08 :heavy_check_mark: AC 13 ms 10 MB
g++ small_degree_09 :heavy_check_mark: AC 13 ms 10 MB
Back to top page