[多项式开根 模板题] BZOJ 3625 [Codeforces Round #250]小朋友和二叉树

令$A(x)=\sum _{i \in S} x^i$
以及$f(x)$为答案的母函数
那么

$$f(x)=A(x)*f^2(x)+1 \\ A(x)*f^2(x)-f(x)+1=0\\f(x)={1 \pm \sqrt{1-4A(x)}\over 2A(x)}={2\over 1 \pm \sqrt{1-4A(x)}}$$
因为 $f(0)=1$ 必取 ${2\over 1 + \sqrt{1-4A(x)}}$
那么就是开根和求逆了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int P=998244353;
const int G=3;
const int N=100005<<2;

inline int Pow(ll a,int b){
  ll ret=1; for (;b;b>>=1,a=a*a%P) if (b&1) ret=ret*a%P; return (int)ret;
}
inline int Inv(int a){
  return Pow(a,P-2);
}
inline int Root(int a){
  if (a==1) return 1;
}

int num;
int w[2][N];

inline void Pre(int n){
  num=n;
  int g=Pow(G,(P-1)/num),invg=Inv(g);
  w[0][0]=w[1][0]=1;
  for (int i=1;i<num;i++)
    w[0][i]=(ll)w[0][i-1]*invg%P,w[1][i]=(ll)w[1][i-1]*g%P;
}

int R[N];
inline void FFT(int *a,int n,int r){
  for (int i=0;i<n;i++) if (i<R[i]) swap(a[i],a[R[i]]);
  for (int i=1;i<n;i<<=1)
    for (int j=0;j<n;j+=(i<<1))
      for (int k=0;k<i;k++){
    ll x=a[j+k],y=(ll)w[r][num/(i<<1)*k]*a[j+i+k]%P;
    a[j+k]=(x+y)%P; a[j+i+k]=(x+P-y)%P;
      }
  if (!r) for (int i=0,inv=Pow(n,P-2);i<n;i++) a[i]=(ll)a[i]*inv%P;
}

inline void GetInv(int *a,int *b,int n){
  static int tmp[N];
  if (n==1) return void(b[0]=Inv(a[0]));
  GetInv(a,b,n>>1);
  for (int i=0;i<n;i++) tmp[i]=a[i],tmp[n+i]=0;
  int L=0; while (!(n>>L&1)) L++;
  for (int i=1;i<(n<<1);i++) R[i]=(R[i>>1]>>1)|((i&1)<<L);
  FFT(tmp,n<<1,1); FFT(b,n<<1,1);
  for (int i=0;i<(n<<1);i++)
    tmp[i]=(ll)b[i]*(2+P-(ll)tmp[i]*b[i]%P)%P;
  FFT(tmp,n<<1,0);
  for (int i=0;i<n;i++) b[i]=tmp[i],b[n+i]=0;
}
const int INV2=(P+1)/2;
inline void GetRoot(int *a,int *b,int n){
  static int tmp[N],invb[N];
  if (n==1) return void(b[0]=Root(a[0]));
  GetRoot(a,b,n>>1);
  memset(invb,0,sizeof(int)*n); GetInv(b,invb,n);
  int L=0; while (!(n>>L&1)) L++;
  for (int i=1;i<(n<<1);i++) R[i]=(R[i>>1]>>1)|((i&1)<<L);
  for (int i=0;i<n;i++) tmp[i]=a[i],tmp[n+i]=0;
  FFT(tmp,n<<1,1); FFT(b,n<<1,1); FFT(invb,n<<1,1);
  for (int i=0;i<(n<<1);i++)
    tmp[i]=(ll)((ll)b[i]*b[i]+tmp[i])%P*invb[i]%P*INV2%P;
  FFT(tmp,n<<1,0);
  for (int i=0;i<n;i++) b[i]=tmp[i],b[n+i]=0;
}

int n,m;
int a[N],b[N];

int main(){
  int c;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(m); read(n);
  for (int i=1;i<=m;i++) read(c),a[c]=P-4; a[0]=1;
  for (m=1;m<=n;m<<=1);
  Pre(m<<1);
  GetRoot(a,b,m);
  b[0]=(b[0]+1)%P;
  memset(a,0,sizeof(int)*m); GetInv(b,a,m);
  for (int i=1;i<=n;i++) printf("%d\n",(ll)a[i]*2%P);
  return 0;
}