HDOJ2844Coins【多重背包+二进制优化】

Coins

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9826    Accepted Submission(s): 3916

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 10 1 2 4 2 1 1 2 5 1 4 2 1 0 0

 

Sample Output

8 4

题意：有n中面值的硬币每种面值的硬币数量已知问这些硬币能组成1-m中的几种多重背包已m作为背包容量在1-m中当有物品的价值等
于背包容量时即能组成该类型。

#include
#include
#include
using namespace std;
struct Node{
    int cost;
    int amount;
}A[110];
int n,m;
int dp[100005];
int MAX(int a,int b)
{
    return a>b?a:b;
}
void zeroone(int cos)
{
    for(int i=m;i>=cos;--i)
    {
        dp[i]=MAX(dp[i],dp[i-cos]+cos);
    }
}
void complete(int cos)
{
    for(int i=cos;i<=m;++i)
    {
        dp[i]=MAX(dp[i],dp[i-cos]+cos);
    }
}
void multiple(int cos,int num)
{
    if(cos*num>m)
    {
        complete(cos);
        return ;
    }
    int k=1;
    while(k