洛谷P4389 付公主的背包（生成函数）

传送门
按照这上面写的推导化简并操作就可以水过这个菜题。
代码：

#include<bits/stdc++.h>
#define ri register int
using namespace std;
const int rlen=1<<18|5;
inline char gc(){
	static char buf[rlen],*ib,*ob;
	(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
	return ib==ob?-1:*ib++;
}
inline int read(){
	int ans=0;
	char ch=gc();
	while(!isdigit(ch))ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return ans;
}
const int mod=998244353,N=1e5+5;
typedef long long ll;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)>=mod?a-=mod:a;}
inline int dec(int a,int b){return a<b?a-b+mod:a-b;}
inline int mul(int a,int b){return 1ll*a*b%mod;}
inline void Add(int&a,int b){(a+=b)>=mod?a-=mod:a;}
inline void Dec(int&a,int b){a=a<b?a-b+mod:a-b;}
inline void Mul(int&a,int b){a=1ll*a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,a=mul(a,a))if(p&1)Mul(ret,a);return ret;}
int lim,tim,w[23],invv[23];
vector<int>rev[23];
inline void init_w(){
	w[22]=ksm(3,(mod-1)>>23),invv[0]=1;
	for(ri i=21;~i;--i)w[i]=mul(w[i+1],w[i+1]);
	for(ri i=1,mt=mod+1>>1;i<23;++i)invv[i]=mul(invv[i-1],mt);
}
inline void init(const int&up){
	lim=1,tim=0;
	while(lim<up)lim<<=1,++tim;
	if(rev[tim].size())return;
	rev[tim].resize(lim);
	for(ri i=0;i<lim;++i)rev[tim][i]=(rev[tim][i>>1]>>1)|((i&1)<<(tim-1));
}
inline void ntt(poly&a,int type){
	for(ri i=0;i<lim;++i)if(i<rev[tim][i])swap(a[i],a[rev[tim][i]]);
	for(ri i=1,t=0,a0,a1;i<lim;i<<=1,++t)for(ri j=0,len=i<<1;j<lim;j+=len)
	for(ri k=0,mt=1;k<i;++k,Mul(mt,w[t]))a0=a[j+k],a1=mul(a[j+k+i],mt),a[j+k]=add(a0,a1),a[j+k+i]=dec(a0,a1);
	if(~type)return;
	reverse(++a.begin(),a.end());
	for(ri i=0;i<lim;++i)Mul(a[i],invv[tim]);
}
inline poly operator*(poly a,poly b){
	int n=a.size(),m=b.size(),t=n+m-1;
	if(t<=128){
		poly c(t);
		for(ri i=0;i<n;++i)for(ri j=0;j<m;++j)Add(c[i+j],mul(a[i],b[j]));
		return c;
	}
	init(t);
	a.resize(lim),ntt(a,1);
	b.resize(lim),ntt(b,1);
	for(ri i=0;i<lim;++i)Mul(a[i],b[i]);
	return ntt(a,-1),a.resize(t),a;
}
inline poly poly_inv(poly a,int k){
	poly c,b(1,ksm(a[0],mod-2));
	for(ri i=4,up=k<<2;i<up;i<<=1){
		init(i);
		c=a,c.resize(i>>1);
		c.resize(lim),ntt(c,1);
		b.resize(lim),ntt(b,1);
		for(ri i=0;i<lim;++i)Mul(b[i],dec(2,mul(b[i],c[i])));
		ntt(b,-1),b.resize(i>>1);
	}
	return b.resize(k),b;
}
inline poly deriv(poly a){
	for(ri i=0,up=a.size()-1;i<up;++i)a[i]=mul(a[i+1],i+1);
	return a.pop_back(),a;
}
int inv[N<<2];
inline poly integ(poly a){
	a.push_back(0);
	for(ri i=a.size()-1;i;--i)a[i]=mul(a[i-1],inv[i]);
	return a[0]=0,a;
}
inline poly poly_ln(poly a,int k){return a=integ(deriv(a)*poly_inv(a,k)),a.resize(k),a;}
inline poly poly_exp(poly a,int k){
	poly b(1,1),c;
	a.resize(k<<1);
	for(ri i=2,up=k<<1;i<up;i<<=1){
		c=poly_ln(b,i);
		for(ri j=0;j<i;++j)c[j]=dec(a[j],c[j]);
		Add(c[0],1);
		b=b*c,b.resize(i);
	}
	return b.resize(k),b;
}
poly f;
int n,m,a[N],b[N],sig=0;
int main(){
	init_w();
	n=read(),m=read();
	inv[1]=1;
	for(ri i=2,up=m<<2;i<=up;++i)inv[i]=mul(inv[mod-mod/i*i],mod-mod/i);
	for(ri i=1;i<=n;++i)a[i]=read();
	sort(a+1,a+n+1);
	for(ri i=1;i<=n;++i){
		if(a[i]^a[i-1])a[++sig]=a[i],b[sig]=1;
		else ++b[sig];
	}
	f.resize(m+1);
	for(ri i=1;i<=m;++i)for(ri j=1,up=m/i;a[j]<=up&&j<=sig;++j)Add(f[i*a[j]],mul(b[j],inv[i]));
	f=poly_exp(f,m+1);
	for(ri i=1;i<=m;++i)cout<<f[i]<<'\n';
	return 0;
}