[luogu5409][NTT][多项式][斯特林数]模板：第一类斯特林数·列

luogu5409

算了懒得写了

Code：

// luogu-judger-enable-o2
#include<bits/stdc++.h>
#define pb push_back
#define poly vector<int>
#define mod 167772161
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=524290,g=3,C=19;
inline int add(int x,int y){x+=y;if(x>=mod) x-=mod;return x;}
inline int dec(int x,int y){x-=y;if(x<0) x+=mod;return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
inline void inc(int &x,int y){x+=y;if(x>=mod) x-=mod;return;}
inline void Dec(int &x,int y){x-=y;if(x<0) x+=mod;return;}
inline void Mul(int &x,int y){x=1ll*x*y%mod;return;}
inline int ksm(int a,int b){int res=1;for(;b;b>>=1,a=mul(a,a)) if(b&1) res=mul(res,a);return res;}
namespace Ntt{
	int *w[20],rev[N];
	inline void init(int n){for(int i=1;i<=n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)*(n>>1));return;}
	inline void init_w(){ 
		for(int i=1;i<=C;i++) w[i]=new int[1<<(i-1)];
		int wn=ksm(g,(mod-1)/(1<<C));
		w[C][0]=1;
		for(int i=1;i<(1<<(C-1));i++) w[C][i]=mul(w[C][i-1],wn);
		for(int i=C-1;i;i--)
			for(int j=0;j<(1<<(i-1));j++) w[i][j]=w[i+1][j<<1];
		return;
	}
	inline void ntt(poly &f,int n,int kd){
		for(int i=0;i<n;i++) if(i>rev[i]) swap(f[i],f[rev[i]]);
		for(int mid=1,l=1;mid<n;mid<<=1,l++)
			for(int i=0;i<n;i+=(mid<<1))
				for(int j=0,a0,a1;j<mid;j++){
					a0=f[i+j],a1=mul(f[i+j+mid],w[l][j]);
					f[i+j]=add(a0,a1);f[i+j+mid]=dec(a0,a1);
				}
		if(kd==-1 && (reverse(f.begin()+1,f.begin()+n),1)) for(int inv=ksm(n,mod-2),i=0;i<n;i++) Mul(f[i],inv);
		return;
	}
}
using namespace Ntt;
namespace poly_calc{
	inline poly operator + (poly a,poly b){
		if(a.size()<b.size()) a.resize(b.size());
		for(int i=0;i<b.size();i++) inc(a[i],b[i]);
		return a;
	}
	inline poly operator - (poly a,poly b){
		if(a.size()<b.size()) a.resize(b.size());
		for(int i=0;i<b.size();i++) Dec(a[i],b[i]);
		return a;
	}
	inline poly operator * (poly a,int b){
		for(int i=0;i<a.size();i++) Mul(a[i],b);
		return a;
	}
	inline poly operator * (poly a,poly b){
		int n=a.size()+b.size()-1,m=1;
		while(m<=n) m<<=1;
		init(m);
		a.resize(m);b.resize(m);
		ntt(a,m,1);ntt(b,m,1);
		for(int i=0;i<m;i++) Mul(a[i],b[i]);
		ntt(a,m,-1);a.resize(n);return a;
	}
	inline poly poly_inv(poly a,int n){
		poly b(1,ksm(a[0],mod-2)),c;
		for(int m=4;m<(n<<2);m<<=1){ 
			c=a,c.resize(m>>1);
			init(m);
			c.resize(m);ntt(c,m,1);
			b.resize(m);ntt(b,m,1);
			for(int i=0;i<m;i++) Mul(b[i],dec(2,mul(b[i],c[i])));
			ntt(b,m,-1);b.resize(m>>1);
		}
		b.resize(n);return b;
	}
	inline poly deriv(poly a){
		for(int i=0;i<a.size()-1;i++) a[i]=mul(a[i+1],i+1);
		a.pop_back();return a;
	}
	int inv[N];
	inline poly integ(poly a){
		a.pb(0);
		for(int i=a.size()-1;i;i--) a[i]=mul(a[i-1],inv[i]);
		a[0]=0;return a;
	}
	inline poly ln(poly a,int n){a=integ(poly_inv(a,n)*deriv(a)),a.resize(n);return a;}
	inline poly ksm(poly a,int b,int n){
		poly res(1,1);
		for(;b;b>>=1){
			if(b&1){res=res*a;if(res.size()>n) res.resize(n);}
			a=a*a;if(a.size()>n) a.resize(n);
		}
		res.resize(n);return res;
	}
}
using namespace poly_calc;
int fac[N],ifac[N];
inline void init_fac(int n){
	inv[1]=1;
	for(int i=2;i<=n;i++) inv[i]=mul((mod-mod/i),inv[mod%i]);
	fac[0]=ifac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=mul(fac[i-1],i);
	ifac[n]=ksm(fac[n],mod-2);
	for(int i=n-1;i;i--)  ifac[i]=mul(ifac[i+1],i+1);return;
}
int n,k;
poly f;
int main(){
	n=read();k=read();init_fac(n);init_w();
	if(n<k){for(int i=0;i<=n;i++) cout<<"0 ";return 0;}
	f.pb(1);f.pb(1);
	f=ln(f,n+1),f=ksm(f,k,n+1);
	f=f*ifac[k];
	for(int i=0;i<k;i++) cout<<"0 ";
	for(int i=k;i<=n;i++){
		int res=f[i];
		if((i-k)&1) Mul(res,dec(0,fac[i]));
		else Mul(res,fac[i]);
		cout<<res<<" ";
	}
	return 0;
}