考虑
x
n
x^n
xn可以看做用
x
x
x种颜色染
n
n
n个格子
那么有
x
n
=
∑
i
=
1
x
(
x
i
)
i
!
S
(
n
,
i
)
x^n=\sum_{i=1}^{x}{x\choose i}i! S(n,i)
xn=∑i=1x(ix)i!S(n,i)
二项式反演
得
x ! S ( n , x ) = ∑ i = 1 x ( − 1 ) x − i ( x i ) i n x!S(n,x)=\sum_{i=1}^x(-1)^{x-i}{x\choose i}i^n x!S(n,x)=∑i=1x(−1)x−i(ix)in
得
S ( n , x ) = ∑ i = 1 x ( − 1 ) x − i ( x − i ) ! i n i ! S(n,x)=\sum_{i=1}^x\frac{(-1)^{x-i}}{(x-i)!}\frac{i^n}{i!} S(n,x)=∑i=1x(x−i)!(−1)x−ii!in
#include<bits/stdc++.h>
using namespace std;
#define gc getchar
inline int read(){
char ch=gc();
int res=0,f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
#define re register
#define pb push_back
#define cs const
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define poly vector<int>
#define bg begin
cs int mod=167772161,G=3;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline void Dec(int &a,int b){(a-=b)<0?(a+=mod):0;}
inline int mul(int a,int b){return 1ll*a*b>=mod?1ll*a*b%mod:a*b;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline int ksm(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 chemx(int &a,int b){a<b?a=b:0;}
inline void chemn(int &a,int b){a>b?a=b:0;}
cs int N=(1<<20)|5,C=20;
poly w[C+1];
int rev[N],fac[N],ifac[N],inv[N];
inline void init(cs int len=N-5){
fac[0]=ifac[0]=inv[0]=inv[1]=1;
for(int i=1;i<=len;i++)fac[i]=mul(fac[i-1],i);
ifac[len]=ksm(fac[len],mod-2);
for(int i=len-1;i;i--)ifac[i]=mul(ifac[i+1],i+1);
for(int i=2;i<=len;i++)inv[i]=mul(mod-mod/i,inv[mod%i]);
}
inline void init_w(){
for(int i=1;i<=C;i++)w[i].resize(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];
}
inline void init_rev(int lim){
for(int i=0;i<lim;i++)rev[i]=(rev[i>>1]>>1)|((i&1)*(lim>>1));
}
inline void ntt(poly &f,int lim,int kd){
for(int i=0;i<lim;i++)if(i>rev[i])swap(f[i],f[rev[i]]);
for(int a0,a1,l=1,mid=1;mid<lim;mid<<=1,l++)
for(int i=0;i<lim;i+=(mid<<1))
for(int j=0;j<mid;j++)
a0=f[i+j],a1=mul(w[l][j],f[i+j+mid]),f[i+j]=add(a0,a1),f[i+j+mid]=dec(a0,a1);
if(kd==-1){
reverse(f.bg()+1,f.bg()+lim);
for(int i=0;i<lim;i++)Mul(f[i],inv[lim]);
}
}
inline poly operator *(poly a,poly b){
int deg=a.size()+b.size()-1,lim=1;
if(deg<=64){
poly c(deg,0);
for(int i=0;i<a.size();i++)
for(int j=0;j<b.size();j++)
Add(c[i+j],mul(a[i],b[j]));
return c;
}
while(lim<deg)lim<<=1;
init_rev(lim);
a.resize(lim),ntt(a,lim,1);
b.resize(lim),ntt(b,lim,1);
for(int i=0;i<lim;i++)Mul(a[i],b[i]);
ntt(a,lim,-1),a.resize(deg);
return a;
}
int n;
poly f,g;
int main(){
init_w(),init();
n=read(),f.resize(n+1),g.resize(n+1);
for(int i=0;i<=n;i++)f[i]=(i&1)?(mod-ifac[i]):ifac[i],g[i]=mul(ksm(i,n),ifac[i]);
f=f*g;
for(int i=0;i<=n;i++)cout<<f[i]<<" ";
}