题目描述
In computer science, a character is a letter, a digit, a punctuation mark or some other similar symbol. Since computers can only process numbers, number codes are used to represent characters, which is known as character encoding. A character encoding system establishes a bijection between the elements of an alphabet of a certain size n and integers from 0 to n−1. Some well known character encoding systems include American Standard Code for Information Interchange (ASCII), which has an alphabet size 128, and the extended ASCII, which has an alphabet size 256.
For example, in ASCII encoding system, the word wdy is encoded as [119, 100, 121], while jsw is encoded as [106, 115, 119]. It can be noticed that both 119+100+121=340 ，and 106+115+119=340 then the sum of the encoded numbers of the two words are equal. In fact, there are in all 903 such words of length 3 in an encoding system of alphabet size 128 (in this example, ASCII). The problem is as follows: given an encoding system of alphabet size n where each character is encoded as a number between 0 and n−1 inclusive, how many different words of length m are there, such that the sum of the encoded numbers of all characters is equal to k?
Since the answer may be large, you only need to output it modulo 998244353.输入
The first line of input is a single integer T (1≤T≤400), the number of test cases.
Each test case includes a line of three integers n,m,k (1≤n,m≤105,0≤k≤105), denoting the size of the alphabet of the encoding system, the length of the word, and the required sum of the encoded numbers of all characters, respectively.
It is guaranteed that the sum of n, the sum of m and the sum of k don't exceed 5×106, respectively.
Each test case includes a line of three integers n,m,k (1≤n,m≤105,0≤k≤105), denoting the size of the alphabet of the encoding system, the length of the word, and the required sum of the encoded numbers of all characters, respectively.
It is guaranteed that the sum of n, the sum of m and the sum of k don't exceed 5×106, respectively.
输出
For each test case, display the answer modulo 998244353 in a single line.
样例输入
4
2 3 3
2 3 4
3 3 3
128 3 340
样例输出
1
0
7
903
题意是从0-n-1这n个数中选m个，和为k的方案数，可以重复选择 也就是将k分成m份，每份为0-n-1 也就是将k+m分成m份，每份为1-n 假设没有上限n，答案就是隔板法 C(k+m-1,m-1) 这里面肯定计算了有大于n的情况 假设我们从这k+m里面拿出一个n，然后将剩下的分成非空的m份，再把这个n加到其中的一份当中，那么至少有一份是大于n的,同样的道理，如果拿出c个n，那么至少有c份是大于n的，因为这里是至少，而不是一定有c份大于n，这其中有包含关系，所以需要容斥一下
#include <bits/stdc++.h> #define ll long long using namespace std; const int p=998244353; const int N=1e6+10; int T,n,m,k; ll fac[N],inv[N]; ll poww(ll x,int y) { ll ret=1; while(y) { if (y&1) ret=ret*x%p; x=x*x%p; y>>=1; } return ret; } void pre() { fac[0]=1; for (int i=1;i<N;i++) fac[i]=fac[i-1]*i%p; inv[N-1]=poww(fac[N-1],p-2); for (int i=N-2;i>=0;i--) inv[i]=inv[i+1]*(i+1)%p; } ll C(int a,int b) { return fac[a]*inv[b]%p*inv[a-b]%p; } ll solve(int n,int m,int k) { if(1ll*(n-1)*m<k) return 0; ll ans=C(k+m-1,m-1); int nn=k/n; for (int i=1;i<=nn;i++) { ll tmp=C(k-i*n+m-1,m-1)*C(m,i)%p; if (i&1) ans=(ans-tmp+p)%p; else ans=(ans+tmp)%p; } return ans; } int main() { pre(); scanf("%d",&T); while (T--) { scanf("%d%d%d",&n,&m,&k); printf("%lld ",solve(n,m,k)); } return 0; }