uva 10910 Marks Distribution

最新推荐文章于 2018-02-06 06:39:22 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2018-02-06 06:39:22 发布

阅读量400

点赞数

分类专栏：数学文章标签： uva 组合数

本文链接：https://blog.csdn.net/tengfei461807914/article/details/65938069

版权

数学专栏收录该内容

80 篇文章 0 订阅

订阅专栏

原题：
In an examination one student appeared in N subjects and has got total T marks. He has passed in all the N subjects where minimum mark for passing in each subject is P . You have to calculate the number of ways the student can get the marks. For example, if N = 3, T = 34 and P = 10 then the
marks in the three subject could be as follows.
这里写图片描述
So there are 15 solutions. So F (3, 34, 10) = 15.
Input
In the first line of the input there will be a single positive integer K followed by K lines each containing a single test case. Each test case contains three positive integers denoting N , T and P respectively. The values of N , T and P will be 1 ≤ N ≤ 70, 1 ≤ P ≤ T ≤ 70. You may assume that the final answer will fit in a standard 32-bit integer.
Output
For each input, print in a line the value of F (N, T, P ).
Sample Input
2
3 34 10
3 34 10
Sample Output
15
15

中文：
给你三个数n,t,p分别表示科目总数，你需要获得的总分数n个学科当中你最少要得到的分数。现在问你有多少中得分方法？

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll CC(ll n,ll k)
{
    if(n-k<k)
        k=n-k;
    ll ans=1;
    for(int i=1;i<=k;i++)
        ans=ans*(n-i+1)/i;
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    ll n,p,t;
    int m;
    cin>>m;
    while(m--)
    {
        cin>>n>>t>>p;
        t-=n*p;
        cout<<CC(t+n-1,n-1)<<endl;
    }
    return 0;
}