传送门
这道题有一个推式子之后分治NTT+Ln+Exp的做法,不过也有一个不用Ln+Exp的做法(理论常数要小点,实际差不多)。
题解:
这道题可以牛顿恒等式直接推出一个非常好写的东西。
首先看一下牛顿恒等式的描述:
对于 n n n次多项式 A ( x ) = ∑ i = 0 n a i x i A(x)=\sum_{i=0}^na_ix^i A(x)=∑i=0naixi, a n ! = 0 a_n!=0 an!=0,设 b i = a n − i b_i=a_{n-i} bi=an−i,其有 n n n个根 x 1 , x 2 ⋯ x n x_1,x_2\cdots x_n x1,x2⋯xn,设 S k = ∑ i = 1 n x i k S_k=\sum_{i=1}^nx_i^k Sk=∑i=1nxik,则有:
∀ t ∈ N ∗ , ∑ i = 1 t S i b t − i + t b t = 0 \forall t\in \mathbb{N}^*,\sum_{i=1}^tS_ib_{t-i}+tb_t=0 ∀t∈N∗,i=1∑tSibt−i+tbt=0
那么这道题要求的东西可以很直接地套上去:
设 C ( x ) = ∏ i = 1 n ( x − a i ) C(x)=\prod_{i=1}^n(x-a_i) C(x)=∏i=1n(x−ai),则 C ( x ) C(x) C(x)的根就是 a i a_i ai,设其 i i i次项系数为 c i c_i ci, b i = c n − i b_i=c_{n-i} bi=cn−i, S k = ∑ i = 1 n a i k S_k=\sum_{i=1}^na_i^k Sk=∑i=1naik。则有:
∀ t ∈ N ∗ , ∑ i = 1 t S i b t − i = − t b t \forall t\in \mathbb{N}^*,\sum_{i=1}^tS_ib_{t-i}=-tb_t ∀t∈N∗,i=1∑tSibt−i=−tbt
左边是一个卷积的形式,乘到右边就是多项式求逆,可以直接得到 S S S的生成函数。
代码:
#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;T num;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline int gi(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int mod=998244353;
inline int add(int a,int b){a+=b-mod;return a+(a>>31&mod);}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
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+=a>>31&mod;}
inline void Dec(int &a,int b){a-=b;a+=a>>31&mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
typedef std::vector<int> Poly;
cs int bit=19,SIZE=1<<bit|1;
int r[SIZE],*w[bit+1];
inline void init_NTT(){
for(int re i=1;i<=bit;++i)w[i]=new int[1<<i-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(int *A,int len,int typ){
for(int re i=1;i<len;++i)if(i<r[i])std::swap(A[i],A[r[i]]);
for(int re i=1,d=1;i<len;i<<=1,++d)
for(int re j=0;j<len;j+=i<<1)
for(int re k=0;k<i;++k){
int &t1=A[j+k],&t2=A[i+j+k],t=mul(t2,w[d][k]);
t2=dec(t1,t),Inc(t1,t);
}
if(typ==-1){
std::reverse(A+1,A+len);
for(int re i=0,inv=power(len,mod-2);i<len;++i)Mul(A[i],inv);
}
}
inline void NTT(Poly &A,int len,int typ){NTT(&A[0],len,typ);}
inline void init_rev(int l){
for(int re i=1;i<l;++i)r[i]=r[i>>1]>>1|((i&1)?l>>1:0);
}
inline Poly operator*(cs Poly &a,cs Poly &b){
int n=a.size(),m=b.size(),deg=n+m-1,l=1;
static int A[SIZE],B[SIZE];
while(l<deg)l<<=1;init_rev(l);
memcpy(A,&a[0],sizeof(int)*n);
memset(A+n,0,sizeof(int)*(l-n));
memcpy(B,&b[0],sizeof(int)*m);
memset(B+m,0,sizeof(int)*(l-m));
NTT(A,l,1);NTT(B,l,1);
for(int re i=0;i<l;++i)Mul(A[i],B[i]);
NTT(A,l,-1);return Poly(A,A+deg);
}
inline Poly Inv(cs Poly &a,int lim=-1){
int n=a.size();if(lim==-1)lim=n;
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<n?a[i]:0;
c.resize(l),NTT(c,l,1);
b.resize(l),NTT(b,l,1);
for(int re i=0;i<l;++i)Mul(b[i],dec(2,mul(b[i],c[i])));
NTT(b,l,-1);b.resize(l>>1);
}b.resize(lim);
return b;
}
int n;
inline Poly solve(int l,int r){
if(l==r){
Poly c;c.resize(2);
c[1]=1;
c[0]=dec(mod,gi());
return c;
}int mid=l+r>>1;
return solve(l,mid)*solve(mid+1,r);
}
signed main(){
#ifdef zxyoi
freopen("sum.in","r",stdin);
#endif
init_NTT();int T=gi();
while(T--){
n=gi();
Poly F=solve(1,n);
std::reverse(F.begin(),F.end());
Poly G;G.resize(n+1);
for(int re i=0;i<=n;++i)G[i]=mul(F[i],mod-i);
G=G*Inv(F);int ans=0;
for(int re i=1;i<=n;++i)ans^=G[i];
cout<<ans<<"\n";
}
return 0;
}