Description
In a strange shop there are n types of coins of value A1, A2 ... An. You have to find the number of ways you can make K using the coins. You can use any coin at most K times.
For example, suppose there are three coins 1, 2, 5. Then if K = 5 the possible ways are:
11111
1112
122
5
So, 5 can be made in 4 ways.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with a line containing two integers n (1 ≤ n ≤ 100) and K (1 ≤ K ≤ 10000). The next line contains n integers, denoting A1, A2 ... An (1 ≤ Ai ≤ 500). All Ai will be distinct.
Output
For each case, print the case number and the number of ways K can be made. Result can be large, so, print the result modulo 100000007.
Sample Input
2
3 5
1 2 5
4 20
1 2 3 4
Sample Output
Case 1: 4
In a strange shop there are n types of coins of value A1, A2 ... An. You have to find the number of ways you can make K using the coins. You can use any coin at most K times.
For example, suppose there are three coins 1, 2, 5. Then if K = 5 the possible ways are:
11111
1112
122
5
So, 5 can be made in 4 ways.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with a line containing two integers n (1 ≤ n ≤ 100) and K (1 ≤ K ≤ 10000). The next line contains n integers, denoting A1, A2 ... An (1 ≤ Ai ≤ 500). All Ai will be distinct.
Output
For each case, print the case number and the number of ways K can be made. Result can be large, so, print the result modulo 100000007.
Sample Input
2
3 5
1 2 5
4 20
1 2 3 4
Sample Output
Case 1: 4
Case 2: 108
题解:本题只能一维dp,二维会超时。
dp[i]:表示i有多少种表示方法。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int mod = 1e8+7;
const int maxn = 10010;
int t,n,k;
int dp[maxn];
int value[maxn];
int main()
{
scanf("%d",&t);
int kase = 0;
while(t--){
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&value[i]);
memset(dp,0,sizeof(dp));
dp[0] = 1;
for(int i=1;i<=n;i++){
for(int j=value[i];j<=k;j++)
dp[j] = (dp[j]+dp[j-value[i]])%mod;
}
printf("Case %d: %d\n",++kase,dp[k]);
}
return 0;
}