|
CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18433 Accepted Submission(s): 7244
Problem Description
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 101 2 4 2 1 12 51 4 2 10 0
Sample Output
84
Source
|
题目大意:给你几种硬币的面值和数量,求这些硬币组合的价值在1~m内的所有可能。
解题思路:运用背包问题求解,只是要考虑到各种硬币的使用次数!
AC代码:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<queue>
#define bug printf("*********\n");
//#define mem(a, b, c) memset(a, b, sizeof(a));
using namespace std;
typedef pair<long long, int> par;
const int mod = 1e9+7;
const int INF = 1e7;
const int N = 1000010;
const double pi = 3.1415926;
using namespace std;
int n, m, a[110], c[110], dp[100010], num[100010];
void solve()
{
memset(dp, 0, sizeof(dp));
memset(num, 0, sizeof(num));
dp[0] = 1;
for(int i = 0; i < n; i ++) {
memset(num, 0, sizeof(num));
//记录硬币使用记录的数组
//对于每类的硬币使用都要清零
for(int j = a[i]; j <= m; j ++) {
if(dp[j-a[i]] && num[j-a[i]] < c[i] && !dp[j]) {
//如果j价格的没有更新,且满足更新条件,就更新它
dp[j] = 1;
num[j] = num[j-a[i]] + 1; //使用的硬币数更新
}
}
}
}
int main()
{
while(~scanf("%d%d", &n, &m)) {
int ans = 0;
if(n == 0 && m == 0) break;
for(int i = 0; i < n ; i ++)
scanf("%d", &a[i]);
for(int i = 0; i < n; i ++)
scanf("%d", &c[i]);
solve();
for(int i = 1; i <= m; i ++) { //计算出总情况
if(dp[i]) ans ++;
}
printf("%d\n", ans);
}
return 0;
}