inter_geo.test.cpp

// @brief Polynomial Interpolation (Geometric Sequence)
#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence"
#pragma GCC optimize("Ofast,unroll-loops")
#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, a, r;
    cin >> n >> a >> r;
    vector<base> y(n);
    copy_n(istream_iterator<base>(cin), n, begin(y));
    polyn(y).chirpz_inverse(r, n).mulx(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();
    }
}