本文主要是介绍POJ 1742 Coins 多重部分和问题，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目链接：POJ 1742 Coins
E. Coins
People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box 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.
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 10 1 2 4 2 1 1 2 5 1 4 2 1 0 0
Sample Output
8 4
题意：每一种硬币有若干个，问可以组成m以内的数的个数。
分析：多重部分和问题，或者叫多重背包。
代码：
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;int n, m, dp[100010], a[110], c[110];
int main()
{while(scanf("%d%d", &n, &m), n, m){for(int i = 0; i < n; i++)scanf("%d", &a[i]);for(int i = 0; i < n; i++)scanf("%d", &c[i]);memset(dp, -1, sizeof(dp));dp[0] = 0;for(int i = 0; i < n; i++)for(int j = 0; j <= m; j++){if(dp[j] >= 0)dp[j] = c[i];else if( j < a[i] || dp[j-a[i]] <= 0)dp[j] = -1;elsedp[j] = dp[j-a[i]]-1;}int cnt = 0;for(int i = 1; i <= m; i++)if(dp[i] >= 0)cnt++;printf("%d\n", cnt);}return 0;
}这篇关于POJ 1742 Coins 多重部分和问题的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
