【CF960G】Bandit Blues（斯特林数）（NTT）

传送门

---

补档计划无题解。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::cerr;
using std::cout;

cs int mod=998244353;
inline int add(int a,int b){a+=b-mod;return a+((a>>31)&mod);}
inline int dec(int a,int b){a-=b;return a+((a>>31)&mod);}
inline int mul(int a,int b){ll 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+=(a>>31)&mod;}
inline void Dec(int &a,int b){a-=b;a+=(a>>31)&mod;}
inline void Mul(int &a,int b){a=mul(a,b);}

cs int bit=20,SIZE=1<<bit|1;

int r[SIZE],*w[bit+1];
int fac[SIZE],inv[SIZE],ifac[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]=fac[1]=ifac[0]=ifac[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[i]=mul(ifac[i-1],inv[i]);
	}
}
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=::inv[len];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);
}

inline int C(int n,int m){return (n>=0&&m>=0&&n>=m)?mul(fac[n],mul(ifac[m],ifac[n-m])):0;}

int a[SIZE],b[SIZE],c[SIZE],pw[SIZE];

inline void solve(int n){
	if(n==1){a[1]=1;return ;}
	if(n&1){
		solve(n-1);
		for(int re i=n;i>=1;--i)a[i]=add(a[i-1],mul(a[i],n-1));
		return ;
	}
	solve(n>>1);
	int l2=n>>1,l=1;pw[0]=1;
	while(l<=n)l<<=1;init_rev(l);
	for(int re i=1;i<=l2;++i)pw[i]=mul(pw[i-1],l2);
	for(int re i=0;i<=l2;++i)c[i]=mul(a[i],fac[i]);
	for(int re i=0;i<=l2;++i)b[l2-i]=mul(pw[i],ifac[i]);
	memset(c+l2+1,0,sizeof(int)*(l-l2));NTT(c,l,1);
	memset(b+l2+1,0,sizeof(int)*(l-l2));NTT(b,l,1);
	for(int re i=0;i<l;++i)Mul(b[i],c[i]);NTT(b,l,-1);
	for(int re i=0;i<=l2;++i)b[i]=mul(b[i+l2],ifac[i]);
	memset(b+l2+1,0,sizeof(int)*(l-l2));NTT(b,l,1);NTT(a,l,1);
	for(int re i=0;i<l;++i)Mul(a[i],b[i]);NTT(a,l,-1);
}

signed main(){
#ifdef zxyoi
	freopen("Bandit.in","r",stdin);
#endif
	init_NTT();
	int n,A,B;scanf("%d%d%d",&n,&A,&B);
	if(n==1){cout<<(A==1&&B==1);return 0;}
	solve(n-1);
	cout<<mul(a[A+B-2],C(A+B-2,A-1));
	return 0;
}