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: Inv of Power Series (verify/poly/inv.test.cpp)

Depends on

Code

// @brief Inv of Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/inv_of_formal_power_series"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/poly.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;}
    polyn(a).inv_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 5 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 151 ms 51 MB
g++ max_random_01 :heavy_check_mark: AC 156 ms 51 MB
g++ max_random_02 :heavy_check_mark: AC 152 ms 51 MB
g++ max_random_03 :heavy_check_mark: AC 155 ms 51 MB
g++ max_random_04 :heavy_check_mark: AC 149 ms 51 MB
g++ max_random_or_zero_00 :heavy_check_mark: AC 147 ms 51 MB
g++ near_262144_00 :heavy_check_mark: AC 83 ms 29 MB
g++ near_262144_01 :heavy_check_mark: AC 80 ms 29 MB
g++ near_262144_02 :heavy_check_mark: AC 117 ms 46 MB
g++ random_00 :heavy_check_mark: AC 133 ms 49 MB
g++ random_01 :heavy_check_mark: AC 150 ms 51 MB
g++ random_02 :heavy_check_mark: AC 23 ms 9 MB
g++ random_03 :heavy_check_mark: AC 143 ms 50 MB
g++ random_04 :heavy_check_mark: AC 120 ms 47 MB
g++ small_degree_00 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_01 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_02 :heavy_check_mark: AC 4 ms 4 MB
g++ small_degree_03 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_04 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_05 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_06 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_07 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_08 :heavy_check_mark: AC 5 ms 4 MB
g++ small_degree_09 :heavy_check_mark: AC 5 ms 4 MB
Back to top page