传送门
题解:
由幂转下降幂的式子:
i n = ∑ j = 1 n S n , j i j ‾ i^n=\sum_{j=1}^nS_{n,j}i^{\underline{j}} in=j=1∑nSn,jij
我们知道 i n = ∑ j = 1 i S n , j j ! ( i j ) i^n=\sum_{j=1}^iS_{n,j}j!{i\choose j} in=j=1∑iSn,jj!(ji)
其实上面的下标可以从 0 0 0开始,直接二项式反演得到:
S n , i = ∑ j = 0 i ( − 1 ) i − j ( i − j ) ! ⋅ j n j ! S_{n,i}=\sum_{j=0}^i\frac{(-1)^{i-j}}{(i-j)!}\cdot \frac{j^n}{j!} Sn,i=j=0∑i(i−j)!(−1)i−j⋅j!jn
是个卷积,直接NTT算就行了。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
using std::cerr;
using std::cout;
cs int mod=167772161;
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){static ll r;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:0;}
inline void Dec(int &a,int b){(a-=b)<0?a+=mod:0;}
inline void Mul(int &a,int b){a=mul(a,b);}
cs int bit=20,SIZE=1<<20|1;
int r[SIZE],*w[bit+1];
int fac[SIZE],ifac[SIZE],inv[SIZE];
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];
fac[0]=ifac[0]=fac[1]=inv[0]=inv[1]=1;
for(int re i=2;i<SIZE;++i)fac[i]=mul(fac[i-1],i),inv[i]=mul(inv[mod%i],mod-mod/i);
ifac[SIZE-1]=power(fac[SIZE-1],mod-2);
for(int re i=SIZE-2;i;--i)ifac[i]=mul(ifac[i+1],i+1);
}
inline void NTT(int *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,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[j+k+i],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 init_rev(int l){
for(int re i=0;i<l;++i)r[i]=r[i>>1]>>1|((i&1)?l>>1:0);
}
int F[SIZE],G[SIZE];
signed main(){
#ifdef zxyoi
freopen("second_stirling_row.in","r",stdin);
#endif
init_NTT();
int n,l=1;scanf("%d",&n);++n;
while(l<(n<<1))l<<=1;init_rev(l);
for(int re i=1;i<n;++i)F[i]=mul(ifac[i],power(i,n-1));
for(int re i=0;i<n;++i)G[i]=(i&1)?mod-ifac[i]:ifac[i];
NTT(F,l,1),NTT(G,l,1);
for(int re i=0;i<l;++i)Mul(F[i],G[i]);NTT(F,l,-1);
for(int re i=0;i<n;++i)cout<<F[i]<<" ";
return 0;
}