hdu 6397 容斥（我写NTT+快速幂还是T了）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
const int maxn=2*1e5+5;
ll fact[maxn],f[maxn],inv[maxn],cal[maxn];
void init()
{
    fact[0]=f[0]=inv[1]=inv[0]=1;
    for(int i=2;i<maxn;++i)
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    for(int i=1;i<maxn;++i)
    {
        fact[i]=fact[i-1]*i%mod;
        f[i]=f[i-1]*inv[i]%mod;
    }
}
ll solve(int n,int m)
{
    if(n<m||n<0||m<0)
        return 0;
    return fact[n]*f[m]%mod*f[n-m]%mod;
}
int main()
{
    int t,n,m,k;
    init();
    scanf("%d",&t);
    while(t--&&scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        memset(cal,0,sizeof(cal));
        for(int i=0;i<=m&&i<=k/n;i++)
            cal[i]=solve(m,i)*solve(k-i*n+m-1,m-1)%mod;
        for(int i=min(m,k/n)-1;i>=0;i--)
            cal[i]=((cal[i]-cal[i+1])%mod+mod)%mod;
        printf("%lld\n",cal[0]);
    }
    return 0;
}