传送门
前置知识:NTT
什么?敢学多项式操作不会FFT/NTT?您还是洗洗睡了吧
解析:
我们发现,当只有常数项的时候,直接求逆元就可以了。相当于 ( m o d x ) \pmod x (modx)
现在考虑在知道了 F ( x ) H ( x ) ≡ 1 ( m o d x ⌊ n 2 ⌋ ) F(x)H(x)\equiv 1\pmod {x^{\lfloor\frac n 2\rfloor}} F(x)H(x)≡1(modx⌊2n⌋)的情况下怎么求 F ( x ) G ( x ) ≡ 1 ( m o d x n ) F(x)G(x)\equiv 1\pmod {x^n} F(x)G(x)≡1(modxn)
显然有 F ( x ) ( G ( x ) − H ( x ) ) ≡ 1 ( m o d x ⌊ n 2 ⌋ ) G ( x ) − H ( x ) ≡ 1 ( m o d x ⌊ n 2 ⌋ ) ( G ( x ) − H ( x ) ) 2 ≡ 0 ( m o d x n ) G 2 ( x ) − 2 G ( x ) H ( x ) + H 2 ( x ) ≡ 0 ( m o d x n ) \begin{aligned} F(x)(G(x)-H(x))&\equiv&& 1\pmod {x^{\lfloor\frac{n}2\rfloor}}\\ G(x)-H(x)&\equiv&& 1\pmod{x^{\lfloor\frac{n}{2}\rfloor}}\\ (G(x)-H(x))^2&\equiv &&0\pmod{x^n}\\ G^2(x)-2G(x)H(x)+H^2(x)&\equiv&& 0\pmod{x^n} \end{aligned} F(x)(G(x)−H(x))G(x)−H(x)(G(x)−H(x))2G2(x)−2G(x)H(x)+H2(x)≡≡≡≡1(modx⌊2n⌋)1(modx⌊2n⌋)0(modxn)0(modxn)
两边同时乘上 F ( x ) F(x) F(x)得到:
G ( x ) ≡ 2 H ( x ) − F ( x ) H 2 ( x ) ( m o d n ) \begin{aligned} G(x)\equiv 2H(x)-F(x)H^2(x)\pmod n \end{aligned} G(x)≡2H(x)−F(x)H2(x)(modn)
于是就可以直接倍增求了。
一般不会直接做卷积而是选择将 2 2 2看做一个多项式,所有位置的点值全部为 2 2 2,于是就可以只对 F F F和 H H H做一次 D F T DFT DFT后得到所有点值,将 2 2 2代入计算后再 I D F T IDFT IDFT回去一次,可以达到常数优化的效果。
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
inline char get_char(){
static cs int Rlen=1<<20|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
inline int getint(){
re char c;
while(!isdigit(c=gc()));re int num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
}
using namespace IO;
cs int mod=998244353,g=3;
inline int add(int a,int b){return a+b>=mod?a+b-mod:a+b;}
inline int dec(int a,int b){return a<b?a-b+mod:a-b;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline int quickpow(int a,int b,int res=1){
while(b){
if(b&1)res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
cs int N=410000;
int r[N];
inline void NTT(int *A,int n,int typ){
for(int re i=0;i<n;++i)if(i<r[i])swap(A[i],A[r[i]]);
for(int re i=1;i<n;i<<=1){
int wn=quickpow(typ==-1?(mod+1)/g:g,(mod-1)/i/2);
for(int re j=0;j<n;j+=i<<1)
for(int re k=0,x,y,w=1;k<i;++k,w=mul(w,wn)){
x=A[j+k],y=mul(A[j+k+i],w);
A[j+k]=add(x,y);
A[j+k+i]=dec(x,y);
}
}
if(typ==-1)for(int re i=0,inv=quickpow(n,mod-2);i<n;++i)A[i]=mul(A[i],inv);
}
int a[N],b[N],c[N];
void Inv(int deg,int *a,int *b){
if(deg==1)return (void)(b[0]=quickpow(a[0],mod-2));
Inv((deg+1)>>1,a,b);
int re len=1;
while(len<(deg<<1))len<<=1;
for(int re i=0;i<len;++i)r[i]=(r[i>>1]>>1)|((i&1)*(len>>1));
memcpy(c,a,sizeof(int)*deg);
memset(c+deg,0,sizeof(int)*(len-deg));
NTT(c,len,1),NTT(b,len,1);
for(int re i=0;i<len;++i)b[i]=mul(b[i],dec(2,mul(c[i],b[i])));
NTT(b,len,-1);
memset(b+deg,0,sizeof(int)*(len-deg));
}
int n;
signed main(){
n=getint();
for(int re i=0;i<n;++i)a[i]=getint();
Inv(n,a,b);
for(int re i=0;i<n;++i)cout<<b[i]<<" ";
return 0;
}