uva10910 背包

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define LL long long
 4 #define qz q.size()
 5 int f[105][105];
 6 int main()
 7 {
 8     int T,N,P,cas,i,j,k;
 9     cin>>cas;
10     while(cas--){
11         cin>>N>>T>>P;
12         memset(f,0,sizeof(f));
13         f[0][0]=1;
14         for(i=1;i<=N;++i)
15         {
16             for(j=P*i;j<=T;j++)
17             {
18                 for(k=P;k<=T;++k)
19                 {
20                     if(j-k<=T&&j-k>=0)
21                     f[i][j]+=f[i-1][j-k];
22                 }
23             }
24         }
25         cout<<f[N][T]<<endl;
26     }
27     return 0;
28 }