感觉和喂鸽子有点像
但是由于智商欠费完全想不出
考虑对于一个舱,计算其满的时候有多少还有没半满的舱的概率
最后乘以
n
n
n即可
考虑容斥
强制有
p
p
p个没满
那么容斥系数就是
(
n
−
1
p
)
(
−
1
)
p
−
1
{n-1\choose p}(-1)^{p-1}
(pn−1)(−1)p−1
考虑转成序列问题
即序列值域为
[
0
,
p
]
[0,p]
[0,p],出现
a
a
a个
0
0
0时
1
−
p
1-p
1−p均出现少于
b
b
b次的概率
考虑
1
−
p
1-p
1−p的每个数的
e
g
f
egf
egf就是
f
(
x
)
=
∑
i
<
b
x
i
i
!
f(x)=\sum_{i<b}\frac{x^i}{i!}
f(x)=∑i<bi!xi
答案就是
∑
j
=
0
p
(
b
−
1
)
(
a
−
1
+
j
)
!
(
a
−
1
)
!
(
1
p
+
1
)
a
+
j
[
x
j
]
f
p
(
x
)
\sum_{j=0}^{p(b-1)}\frac{(a-1+j)!}{(a-1)!}(\frac{1}{p+1})^{a+j}[x^j]f^p(x)
∑j=0p(b−1)(a−1)!(a−1+j)!(p+11)a+j[xj]fp(x)
即枚举最后一个
0
0
0的位置,则前面恰有
a
−
1
a-1
a−1个
0
0
0与
1
−
p
1-p
1−p组合即可
直接
n
t
t
ntt
ntt求
f
p
f^p
fp是
O
(
n
3
l
o
g
)
O(n^3log)
O(n3log)的,也可以过
但考虑
f
f
f很像
e
x
e^x
ex
发现有
f
−
f
′
=
x
b
−
1
(
b
−
1
)
!
f-f'=\frac{x^{b-1}}{(b-1)!}
f−f′=(b−1)!xb−1
于是有
(
f
p
)
′
=
p
f
p
−
1
f
′
=
p
f
p
−
p
f
p
−
1
x
b
−
1
(
b
−
1
)
!
(f^p)'=pf^{p-1}f'=pf^p-pf^{p-1}\frac{x^{b-1}}{(b-1)!}
(fp)′=pfp−1f′=pfp−pfp−1(b−1)!xb−1
于是
p
f
p
−
(
f
p
)
′
=
p
f
p
−
1
x
b
−
1
(
b
−
1
)
!
pf^p-(f^{p})'=pf^{p-1}\frac{x^{b-1}}{(b-1)!}
pfp−(fp)′=pfp−1(b−1)!xb−1
直接递推即可
复杂度 O ( n 3 ) O(n^3) O(n3)
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define y1 shinkle
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool 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;
}
inline ll readll(){
char ch=gc();
ll res=0;bool 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;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int mod=998244353;
inline int add(int a,int b){return (a+b)>=mod?(a+b-mod):(a+b);}
inline int dec(int a,int b){return (a<b)?(a-b+mod):(a-b);}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){a=(a+b)>=mod?(a+b-mod):(a+b);}
inline void Dec(int &a,int b){a=(a<b)?(a-b+mod):(a-b);}
inline void Mul(int &a,int b){static ll r;r=(ll)a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(int x){return (x<0)?x+mod:x;}
cs int M=100005;
int fac[M],ifac[M],inv[M];
inline void init_fac(){
fac[0]=ifac[0]=inv[0]=inv[1]=1;
for(int i=1;i<M;i++)fac[i]=mul(fac[i-1],i);
ifac[M-1]=Inv(fac[M-1]);
for(int i=M-2;i;i--)ifac[i]=mul(ifac[i+1],i+1);
for(int i=2;i<M;i++)inv[i]=mul(mod-mod/i,inv[mod%i]);
}
inline int C(int n,int m){return (n<m||n<0||m<0)?0:mul(fac[n],mul(ifac[m],ifac[n-m]));}
cs int N=255;
int f[N*N],g[N*N],n,a,b;
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
init_fac();
n=read(),a=read(),b=read();
for(int i=0;i<b;i++)f[i]=ifac[i];
int res=0;
for(int i=1;i<n;i++){
int now=0;
for(int j=0,mt=ksm(inv[i+1],a);j<=i*(b-1);j++,Mul(mt,inv[i+1]))
Add(now,mul(f[j],mul(fac[j+a-1],mt)));
Mul(now,mul(ifac[a-1],C(n-1,i)));
if(i&1)Add(res,now);else Dec(res,now);
int c=mul(i+1,ifac[b-1]);
for(int j=0;j<=i*(b-1);j++)Mul(f[j],c);
for(int j=(i+1)*(b-1);j>=b-1;j--)f[j]=f[j-b+1];
for(int j=0;j<b-1;j++)f[j]=0;
g[0]=1;
for(int j=1;j<=(i+1)*(b-1);j++)
g[j]=mul(dec(mul(g[j-1],i+1),f[j-1]),inv[j]);
memcpy(f,g,sizeof(g));
}
cout<<mul(res,n)<<'\n';
return 0;
}