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: Lazy FPS: Pow of Power Series (verify/fps/pow.test.cpp)

Depends on

Code

// @brief Lazy FPS: Pow of Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/pow_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;
    int64_t m;
    cin >> n >> m;
    polyn::Vector a(n);
    for(auto &it: a) {cin >> it;}
    pow(fps<base>(polyn(std::move(a))), m).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++ M_zero_00 :heavy_check_mark: AC 13 ms 12 MB
g++ M_zero_01 :heavy_check_mark: AC 15 ms 14 MB
g++ all_zero_00 :heavy_check_mark: AC 15 ms 11 MB
g++ all_zero_01 :heavy_check_mark: AC 17 ms 12 MB
g++ binary_exp_max_00 :heavy_check_mark: AC 395 ms 55 MB
g++ example_00 :heavy_check_mark: AC 3 ms 6 MB
g++ example_01 :heavy_check_mark: AC 7 ms 8 MB
g++ example_02 :heavy_check_mark: AC 2 ms 6 MB
g++ hack_00 :heavy_check_mark: AC 2 ms 6 MB
g++ lower_deg_zero2_00 :heavy_check_mark: AC 345 ms 55 MB
g++ lower_deg_zero2_01 :heavy_check_mark: AC 270 ms 54 MB
g++ lower_deg_zero2_02 :heavy_check_mark: AC 242 ms 54 MB
g++ lower_deg_zero2_03 :heavy_check_mark: AC 33 ms 21 MB
g++ lower_deg_zero_00 :heavy_check_mark: AC 18 ms 14 MB
g++ lower_deg_zero_01 :heavy_check_mark: AC 20 ms 16 MB
g++ lower_deg_zero_02 :heavy_check_mark: AC 18 ms 13 MB
g++ lower_deg_zero_03 :heavy_check_mark: AC 19 ms 13 MB
g++ lower_deg_zero_04 :heavy_check_mark: AC 20 ms 15 MB
g++ lower_deg_zero_05 :heavy_check_mark: AC 21 ms 15 MB
g++ lower_deg_zero_06 :heavy_check_mark: AC 21 ms 16 MB
g++ lower_deg_zero_07 :heavy_check_mark: AC 19 ms 14 MB
g++ max_random_00 :heavy_check_mark: AC 400 ms 55 MB
g++ max_random_01 :heavy_check_mark: AC 400 ms 55 MB
g++ max_random_02 :heavy_check_mark: AC 399 ms 55 MB
g++ monomial_00 :heavy_check_mark: AC 18 ms 13 MB
g++ monomial_01 :heavy_check_mark: AC 17 ms 13 MB
g++ monomial_02 :heavy_check_mark: AC 18 ms 13 MB
g++ monomial_03 :heavy_check_mark: AC 18 ms 13 MB
g++ monomial_ans_low_deg_00 :heavy_check_mark: AC 37 ms 20 MB
g++ monomial_ans_low_deg_01 :heavy_check_mark: AC 23 ms 15 MB
g++ monomial_ans_low_deg_02 :heavy_check_mark: AC 9 ms 9 MB
g++ monomial_ans_low_deg_03 :heavy_check_mark: AC 36 ms 20 MB
g++ overflow_killer_00 :heavy_check_mark: AC 2 ms 6 MB
g++ overflow_killer_01 :heavy_check_mark: AC 2 ms 6 MB
g++ random_00 :heavy_check_mark: AC 306 ms 52 MB
g++ random_01 :heavy_check_mark: AC 372 ms 55 MB
g++ random_02 :heavy_check_mark: AC 46 ms 13 MB
Back to top page