2019.03.18【洛谷P5205】【模板】多项式开根（NTT）

传送门

---

解析：

考虑倍增：假设现在知道$$B_0^2(x)\equiv A(x)(\mathrm{m}\mathrm{o}\mathrm{d}{x}^{\frac{n}{2}})$$

现在显然有$$\begin{array}{rlrl}B(x)-B_0(x)& \equiv & & 0(\mathrm{m}\mathrm{o}\mathrm{d}{x}^{\frac{n}{2}})\\ (B(x)-B_0(x){)}^2& \equiv & & 0(\mathrm{m}\mathrm{o}\mathrm{d}{x}^n)\\ B^2(x)-2B(x)B_0(x)+B_0^2(x)& \equiv & & 0(\mathrm{m}\mathrm{o}\mathrm{d}{x}^n)\\ B(x)& \equiv & & \frac{A(x)+B_0^2(x)}{2B_0(x)}(\mathrm{m}\mathrm{o}\mathrm{d}{x}^n)\end{array}$$

---

代码：

#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,inv2=(mod+1)>>1;
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 len,int typ){
	for(int re i=0;i<len;++i)if(i<r[i])swap(A[i],A[r[i]]);
	for(int re i=1;i<len;i<<=1){
		int wn=quickpow(typ==-1?(mod+1)/3:3,(mod-1)/2/i);
		for(int re j=0;j<len;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(w,A[j+k+i]);
			A[j+k]=add(x,y);
			A[j+k+i]=dec(x,y); 
		}
	}
	if(typ==-1)for(int re i=0,inv=quickpow(len,mod-2);i<len;++i)A[i]=mul(A[i],inv);
}

inline void Inv(int deg,int *a,int *b){
	if(deg==1){b[0]=quickpow(a[0],mod-2);return ;}
	static int c[N];
	Inv(deg>>1,a,b);
	int re len=deg<<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(b[i],c[i])));
	NTT(b,len,-1);
	memset(b+deg,0,sizeof(int)*(len-deg));
}

inline void Sqrt(int deg,int *a,int *b){
	if(deg==1){b[0]=1;return ;}
	static int B[N],C[N],D[N];
	Sqrt(deg>>1,a,b);
	for(int re i=0;i<deg;++i)C[i]=add(b[i],b[i]);
	memcpy(D,b,sizeof(int)*deg);
	memset(B,0,sizeof(int)*deg);
	Inv(deg,C,B);
	int re len=deg<<1;
	
	for(int re i=0;i<len;++i)r[i]=(r[i>>1]>>1)|((i&1)*(len>>1));
	NTT(D,len,1);
	for(int re i=0;i<len;++i)b[i]=mul(D[i],D[i]);
	NTT(b,len,-1);
	memset(b+deg,0,sizeof(int)*(len-deg));
	for(int re i=0;i<deg;++i)b[i]=add(b[i],a[i]);
	NTT(b,len,1),NTT(B,len,1);
	for(int re i=0;i<len;++i)b[i]=mul(b[i],B[i]);
	NTT(b,len,-1);
	memset(b+deg,0,sizeof(int)*(len-deg));
}

int n;
int a[N],b[N];
signed main(){
	n=getint();
	for(int re i=0;i<n;++i)a[i]=getint();
	int re len=1;
	while(len<=n)len<<=1;
	Sqrt(len,a,b);
	for(int re i=0;i<n;++i)cout<<b[i]<<" ";
	return 0;
}