hdu 6397 Character Encoding

http://acm.hdu.edu.cn/showproblem.php?pid=6397

分析在这篇博客：https://blog.csdn.net/qq_37891604/article/details/81710038

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=200100;
const int mod=998244353;
ll fac[maxn];
ll inv[maxn];
ll qpow(long long a,long long b)
{
    ll ans=1;
    ll k=a;
    while(b)
    {
        if(b&1)ans=ans*k%mod;
        k=k*k%mod;
        b>>=1;
    }
    return (ans+mod)%mod;
}
void init(){
    long long i;
    fac[0]=1;
    inv[0]=1;
    fac[1]=1;
    inv[1]=1;
    for (i=2;i<maxn;i++){
        fac[i]=((fac[i-1]*i)%mod+mod)%mod;
        inv[i]=(qpow(fac[i],mod-2)+mod)%mod;
    }
}
ll C(ll n,ll m){
    if (n<m||m<0) return 0;
    return  (fac[n]*inv[m]%mod*inv[n-m]%mod+mod)%mod;
}
int main()
{
    ll t,n,m,k,i,tmp;
    ll ans;
    init();
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&n,&m,&k);
        ans=C(k+m-1,m-1);
        tmp=-1;
        for(i=1;i<=k/n;i++)
        {
            ans=(ans+tmp*C(m,i)%mod*C(k-i*n+m-1,m-1)%mod+mod)%mod;
            tmp=-tmp;
        }
        printf("%lld\n",ans);
    }
}