HDU6397 Character Encoding 插板法+容斥

HDU6397 Character Encoding

组合计数—插板法+容斥原理

给定n,m,K求                           

 G(p) = F(p)−G(p+1)，F(p)=(m,p)*(K-n*p+m-1,m-1)，p表示>n的组数，根据容斥原理，G(0) 即为最终答案。

#include<bits/stdc++.h>
using namespace std;
const int MAX=1e5+1;
const long long MOD=998244353;
long long fact[2*MAX];
int m,n,K;
void init()
{
    fact[0]=1;
    for(int i=1;i<2*MAX;i++) fact[i]=fact[i-1]*i%MOD;
}
long long inv(long long a,long long m)
{
    if(a==1) return 1;
    return inv(m%a,m)*(m-m/a)%m;
}
long long C(int a,int b)
{
    if(a<b) return 0;
    return fact[a]*inv(fact[b]*fact[a-b]%MOD,MOD)%MOD;
}
long long in_ex(int b,int mul)
{
    if(b<0) return 0;
    return (C(b+m-1,m-1)*C(m,mul)%MOD-in_ex(b-n,mul+1)+MOD)%MOD;
}
int main()
{
//    freopen("a.in","r",stdin);
//    freopen("out.txt","w",stdout);
    int t;
    init();
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&K);
        long long tmn=(long long)m*(n-1),tk=(long long)K;
        if(tmn<tk) printf("0\n");
        else printf("%I64d\n",in_ex(K,0));
    }
    return 0;
}