uva 10910（子集和问题）

Marks Distribution

Time limit: 3.000 seconds

In an examination one student appeared in N subjects and has got total T marks. He has passed in all the Nsubjects 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.

	Subject 1	Subject 2	Subject 3
1	14	10	10
2	13	11	10
3	13	10	11
4	12	11	11
5	12	10	12
6	11	11	12
7	11	10	13
8	10	11	13
9	10	10	14
10	11	12	11
11	10	12	12
12	12	12	10
13	10	13	11
14	11	13	10
15	10	14	10

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 at most 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	Output for Sample Input
2 3 34 10 3 34 10	15 15

思路：过程的最后一步为前n门课总分为j的种类；

　　　　最后一步的子问题为：前n-1门课总分为j-k的种类；

　　　　显然；k>=p&&k<=j-p*(n-1);(保证每门课都能取到最低值)；

　　　　状态转移方程为：dp[i][j]+=dp[i-1][j-k];

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<cstdlib>
 #include<iomanip>
 #include<cmath>
 #include<vector>
 #include<queue>
 #include<stack>
 using namespace std;
 #define PI 3.141592653589792128462643383279502
 int dp[][];
 int n;
 int main(){
     //#ifdef CDZSC_June
     //freopen("in.txt","r",stdin);
     //#endif
     //std::ios::sync_with_stdio(false);
     cin>>n;
     int N,T,P;
     while(n--){
         cin>>N>>T>>P;

         memset(dp,,sizeof(dp));
         for(int i=;i<=;i++)dp[][i]=;
         for(int i=;i<=N;i++)
         for(int j=P;j<=T;j++){
             for(int k=P;k<=j-P*(i-);k++)
             dp[i][j]+=dp[i-][j-k];
         }
     cout<<dp[N][T]<<endl;
     }
     return ;
 }