# Submit Info #51228

Problem Lang User Status Time Memory
Polynomial Taylor Shift cpp alaneos777 AC 220 ms 28.70 MiB

ケース詳細
Name Status Time Memory
example_00 AC 1 ms 0.61 MiB
example_01 AC 1 ms 0.71 MiB
fft_killer_00 AC 217 ms 28.69 MiB
fft_killer_01 AC 218 ms 28.68 MiB
max_random_00 AC 220 ms 28.70 MiB
max_random_01 AC 219 ms 28.70 MiB
medium_00 AC 1 ms 0.84 MiB
medium_01 AC 3 ms 1.09 MiB
medium_02 AC 3 ms 1.08 MiB
medium_all_zero_00 AC 1 ms 0.71 MiB
medium_c_zero_00 AC 1 ms 0.71 MiB
random_00 AC 193 ms 25.59 MiB
random_01 AC 207 ms 27.28 MiB
random_02 AC 23 ms 3.92 MiB
small_00 AC 1 ms 0.61 MiB
small_01 AC 1 ms 0.71 MiB
small_02 AC 1 ms 0.61 MiB
small_03 AC 1 ms 0.61 MiB
small_04 AC 1 ms 0.61 MiB
small_05 AC 1 ms 0.70 MiB
small_06 AC 1 ms 0.71 MiB
small_07 AC 1 ms 0.61 MiB
small_08 AC 1 ms 0.61 MiB
small_09 AC 1 ms 0.61 MiB
small_10 AC 1 ms 0.45 MiB
small_11 AC 1 ms 0.71 MiB
small_12 AC 1 ms 0.71 MiB
small_13 AC 1 ms 0.61 MiB
small_14 AC 1 ms 0.71 MiB
small_15 AC 1 ms 0.71 MiB

#include <bits/stdc++.h> using namespace std; using lli = long long int; using poly = vector<int>; template<lli mod> lli powerMod(lli a, lli b){ lli ans = 1; while(b){ if(b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } int nearestPowerOfTwo(int n){ int ans = 1; while(ans < n) ans <<= 1; return ans; } template<int mod, int g> void ntt(poly& a, int inv = 1){ int n = a.size(); for(int i = 1, j = 0; i < n-1; ++i){ for(int k = n>>1; (j^=k) < k; k >>= 1); if(i < j) swap(a[i], a[j]); } for(int sz = 2; sz <= n; sz <<= 1){ lli w_1 = powerMod<mod>(g, (mod-1)/sz); if(inv == -1) w_1 = powerMod<mod>(w_1, mod-2); vector<lli> w(sz/2, 1); for(int j = 1; j < sz/2; ++j){ w[j] = w_1 * w[j-1] % mod; } for(int start = 0; start < n; start += sz){ for(int j = 0; j < sz/2; ++j){ int u = a[start + j], v = w[j] * a[start + sz/2 + j] % mod; a[start + j] = (u+v >= mod ? u+v-mod : u+v); a[start + sz/2 + j] = (u-v < 0 ? u-v+mod : u-v); } } } if(inv == -1){ lli n_rev = powerMod<mod>(n, mod-2); for(int& ai : a){ ai = ai * n_rev % mod; } } } template<int mod, int g> poly convolution(poly a, poly b){ int sz = a.size() + b.size() - 1; int SZ = nearestPowerOfTwo(sz); a.resize(SZ), b.resize(SZ); ntt<mod, g>(a, 1), ntt<mod, g>(b, 1); poly c(SZ); for(int i = 0; i < SZ; ++i){ c[i] = (lli)a[i] * b[i] % mod; } ntt<mod, g>(c, -1); c.resize(sz); return c; } const int p = 998244353, g = 3; int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, c; cin >> n >> c; poly fact(n, 1), inv(n, 1), invfact(n, 1); for(lli i = 2; i < n; ++i){ fact[i] = i * fact[i-1] % p; inv[i] = p - (p / i) * inv[p % i] % p; invfact[i] = (lli)inv[i] * invfact[i-1] % p; } poly A(n); for(int& ai : A){ cin >> ai; } poly P(n), Q(n); for(int i = 0; i < n; ++i){ P[i] = (lli)A[i] * fact[i] % p; Q[n-1-i] = powerMod<p>(c, i) * invfact[i] % p; } poly R = convolution<p,g>(P, Q); for(int i = 0; i < n; ++i){ cout << (lli)R[i+n-1]*invfact[i]%p << " "; } cout << "\n"; return 0; }