Polynomial Interpolation (Geometric Sequence) (verify/poly/inter_geo.test.cpp)

• View this file on GitHub
• Last update: 2026-09-18 20:05:44+02:00
• Problem: https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence

Depends on

• cp-algo/math/affine.hpp
• cp-algo/math/combinatorics.hpp
• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/factorials.hpp
• cp-algo/math/fft.hpp
• cp-algo/math/poly/base.hpp
• cp-algo/math/poly/calculus.hpp
• cp-algo/math/poly/chirpz.hpp
• cp-algo/math/poly/series/inv.hpp
• cp-algo/math/poly/transform.hpp
• cp-algo/math/ring.hpp
• cp-algo/number_theory/discrete_sqrt.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/number_theory/primality.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/bump_alloc.hpp
• cp-algo/util/checkpoint.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Polynomial Interpolation (Geometric Sequence)
#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/poly/chirpz.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, a, r;
    cin >> n >> a >> r;
    polyn::Vector y(n);
    for(auto &it: y) {cin >> it;}
    mulx(chirpz_inverse(polyn(std::move(y)), r, n), base(a).inv()).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	2 ms	6 MB
g++	example_01	AC	2 ms	6 MB
g++	max_random_00	AC	65 ms	59 MB
g++	max_random_01	AC	65 ms	59 MB
g++	max_random_02	AC	66 ms	59 MB
g++	nar_0_00	AC	2 ms	6 MB
g++	nar_0_01	AC	2 ms	6 MB
g++	nar_0_02	AC	2 ms	6 MB
g++	nar_0_03	AC	2 ms	6 MB
g++	nar_0_04	AC	2 ms	6 MB
g++	nar_0_05	AC	2 ms	6 MB
g++	nar_0_06	AC	2 ms	6 MB
g++	nar_0_07	AC	2 ms	6 MB
g++	near_pow2_00	AC	34 ms	32 MB
g++	near_pow2_01	AC	34 ms	32 MB
g++	near_pow2_02	AC	35 ms	32 MB
g++	near_pow2_03	AC	44 ms	55 MB
g++	near_pow2_04	AC	44 ms	55 MB
g++	pow_rN_equal_1_00	AC	41 ms	55 MB
g++	pow_rN_equal_1_01	AC	55 ms	58 MB
g++	pow_rN_equal_1_02	AC	7 ms	10 MB
g++	random_00	AC	59 ms	59 MB
g++	random_01	AC	65 ms	58 MB
g++	random_02	AC	10 ms	11 MB
g++	small_00	AC	2 ms	6 MB
g++	small_01	AC	2 ms	6 MB
g++	small_02	AC	2 ms	6 MB
g++	y0_00	AC	9 ms	9 MB

Back to top page