https://codeforces.com/gym/103428/problem/M
题意:n场比赛赢了m场,求最长连续胜场为k的方案数
参考题解:https://zhuanlan.zhihu.com/p/439674716
思路:
1.最长连续胜场为k→最长连续胜场小于等于k-最长连续胜场小于等于(k-1)
2.最长连续胜场小于等于k→所有方案-至少有1个连续胜场大于k+至少有2个连续胜场大于k-至少有3个连续胜场大于k……
3.至少有i个连续胜场大于k:隔板法,首先给i段都加上(k+1),同时在总和中减去i*(k+1),等同于保证i段胜场长度大于k;计数结果为C(n-(k+1)*i,n-m)*C(n-m+1,i),(隔板方案 × n-m+1段中选择i段来强制加(k+1))
写题过程中经历了隔板法写错、搞混组合数的意义Orz
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#define debug cout<<"****************"<<endl
#define rep(i,x,y) for(auto i=(x);i<=(y);++i)
#define dep(i,x,y) for(auto i=(x);i>=(y);--i)
using namespace std;
typedef long long ll;
inline void ju() {
freopen("***.in","r",stdin);
freopen("***.out","w",stdout);
}
inline ll rd() {
ll x=0,f=1; char c=getchar();
while((c<'0'||c>'9')&&(c!='-')) c=getchar();
if(c=='-') f=-1,c=getchar();
while(c>='0'&&c<='9') {
x=(x<<3)+(x<<1)+c-'0';
c=getchar();
}
return x*f;
}
const int N=1e5+10;
const ll mo=998244353;
ll n,m,k;
ll fac[N],inv[N];
ll po(ll x,ll y) {
ll res=1;
while(y) {
if(y&1) res=res*x%mo;
x=x*x%mo;
y>>=1;
}
return res;
}
void init() {
fac[0]=1;
rep(i,1,N-1) fac[i]=fac[i-1]*i%mo;
inv[N-1]=po(fac[N-1],mo-2);
dep(i,N-2,0) inv[i]=inv[i+1]*(i+1)%mo;
}
ll C(ll n,ll k) {
assert(n>=k&&k>=0);
return fac[n]*inv[k]%mo*inv[n-k]%mo;
}
ll sol(ll k) {
ll ans=0;
for(ll i=0,t=1;i<=n-m+1&&n-(k+1)*i>=n-m;i++,t=-t)
ans=(ans+t*C(n-(k+1)*i,n-m)*C(n-m+1,i)%mo+mo)%mo;
return ans;
}
int main() {
n=rd(),m=rd(),k=rd();
init();
// rep(i,1,m) cout<<sol(i)<<' '; puts("");
cout<<(sol(k)-sol(k-1)+mo)%mo<<endl;
return 0;
}