【THUPC2017】【LOJ2409】小 L 的计算题 / Sum（NTT）（多项式求Ln）

传送门

---

题解：

好像有一种用牛顿恒等式的神仙做法？然而我并不会。

考虑构造$f_i$的生成函数：

$$\begin{array}{rlrl}F(x)& =& & \sum _{i=0}^{\infty }{f}_i{x}^i\\ & =& & \sum _{i=0}^{\infty }{x}^i\sum _{j=0}^n{a}_j^i\\ & =& & \sum _{i=0}^n\sum _{j=0}^{\infty }{a}_i^j{x}^j\\ & =& & \sum _{i=0}^n\frac{1}{1-a_{i}x}\\ & =& & n-x\cdot \sum _{i=0}^n\frac{-a_i}{1-a_{i}x}\\ & =& & n-x\cdot (\ln (\prod _{i=0}^n(1-a_{i}x)){)}^{\prime }\end{array}$$

分治FFT即可。

---

代码：

#include<bits/stdc++.h>
#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<<22|1;
		static char buf[Rlen],*p1,*p2;
		return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
	}
	
	template<typename T>
	inline T get(){
		char c;
		while(!isdigit(c=gc()));T num=c^48;
		while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
		return num;
	}
	inline int getint(){return get<int>();}
}
using namespace IO;

using std::cerr;
using std::cout;

std::ostream &operator<<(std::ostream &out,cs std::vector<int> &a){
	if(!a.size())out<<"empty ";
	for(int re i:a)out<<i<<" ";
	return out;
}

cs int mod=998244353;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){ll r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
	for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
	return res;
}
inline void Inc(int &a,int b){(a+=b)>=mod&&(a-=mod);}
inline void Dec(int &a,int b){(a-=b)<0&&(a+=mod);}

typedef std::vector<int> Poly;

cs int bit=20,N=1<<bit|1;

int r[N],*w[bit+1];
inline void init_NTT(){
	for(int re i=1;i<=bit;++i)w[i]=new int[(1<<i-1)+1];
	int wn=power(3,mod-1>>bit);
	w[bit][0]=1;
	for(int re i=1;i<(1<<bit-1);++i)w[bit][i]=mul(w[bit][i-1],wn);
	for(int re i=bit-1;i;--i)
	for(int re j=0;j<(1<<i-1);++j)w[i][j]=w[i+1][j<<1];
}
inline void NTT(Poly &A,int len,int typ){
	for(int re i=0;i<len;++i)if(i<r[i])std::swap(A[i],A[r[i]]);
	for(int re i=1,t=1;i<len;i<<=1,++t)
	for(int re j=0;j<len;j+=i<<1)
	for(int re k=0;k<i;++k){
		int x=A[j+k],y=mul(A[j+k+i],w[t][k]);
		A[j+k]=add(x,y),A[j+k+i]=dec(x,y);
	}
	if(typ==-1){
		std::reverse(A.begin()+1,A.begin()+len);
		for(int re i=0,inv=power(len,mod-2);i<len;++i)A[i]=mul(A[i],inv);
	}
}
inline void init_rev(int len){
	for(int re i=0;i<len;++i)r[i]=r[i>>1]>>1|((i&1)?len>>1:0);
}

inline Poly operator*(Poly a,Poly b){
	int deg=a.size()+b.size()-1,l=1;
	while(l<deg)l<<=1;init_rev(l);
	a.resize(l),NTT(a,l,1);
	b.resize(l),NTT(b,l,1);
	for(int re i=0;i<l;++i)a[i]=mul(a[i],b[i]);
	NTT(a,l,-1),a.resize(deg);
	return a;
}

int inv[N];
inline void init_inv(){
	inv[0]=inv[1]=1;
	for(int re i=2;i<N;++i)inv[i]=mul(inv[mod%i],mod-mod/i);
}
inline Poly Deriv(Poly a){
	for(int re i=0;i+1<a.size();++i)a[i]=mul(a[i+1],i+1);
	a.pop_back();return a;
}

inline Poly Integ(Poly a){
	a.push_back(0);
	for(int re i=a.size()-1;i;--i)a[i]=mul(a[i-1],inv[i]);
	a[0]=0;return a;
}

inline Poly Inv(cs Poly &a,int lim){
	Poly c,b(1,power(a[0],mod-2));
	for(int re l=4;(l>>2)<lim;l<<=1){
		init_rev(l);
		c.resize(l>>1);for(int re i=0;i<(l>>1);++i)c[i]=i<a.size()?a[i]:0;
		c.resize(l);b.resize(l);
		NTT(c,l,1);NTT(b,l,1);
		for(int re i=0;i<l;++i)b[i]=mul(b[i],dec(2,mul(b[i],c[i])));
		NTT(b,l,-1),b.resize(l>>1);
	}b.resize(lim);
	return b;
}

inline Poly Ln(Poly a,int lim){
	a=Integ(Deriv(a)*Inv(a,lim));
	a.resize(lim);
	return a;
}

cs int M=2e5+5;

int n;
int a[M];

Poly solve(int l,int r){
	if(l==r){
		Poly a(2,1);a[1]=dec(0,::a[l]);
		return a;
	}int mid=l+r>>1;
	return solve(l,mid)*solve(mid+1,r);
}

inline void solve(){
	n=getint();
	for(int re i=1;i<=n;++i){
		a[i]=add(getint(),0);
	}
	Poly f=solve(1,n);
	f=Ln(f,f.size()+1);
	f=Deriv(f);
	int ans=0;
	for(int re i=0;i<n;++i)ans^=dec(0,f[i]);
	cout<<ans<<"\n";
} 

signed main(){
	init_NTT();
#ifdef zxyoi
	freopen("sum.in","r",stdin);
#endif
	init_inv();
	int T=getint();
	while(T--)solve();
	return 0;
}