HDU 2844 Coins(多重背包模板题)

Coins

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

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
  
  

 

本题题意是有一定数量，不同价值的硬币，问这些硬币小于m的组合有几种。
多重背包的典型模板题

下面是AC代码：

#include<iostream>
#include <stdio.h>
using namespace std;

const int MAX=100005;
int dp[MAX],c[MAX],w[MAX],v;
void ZP(int cost,int wei)
{
    int i;
    for(i=v;i>=cost;i--)
    {
        dp[i]=max(dp[i],dp[i-cost]+wei);
    }
}
void MP(int cost,int wei,int cnt)
{
    int i;
    if(v<=cnt*cost)
    {
    for(i = cost;i<=v;i++)
    {
        dp[i] = max(dp[i],dp[i-cost]+wei);
    }
    return ;
    }
    else
    {
        int k = 1;
        while(k<=cnt)
        {
            ZP(k*cost,k*wei);
            cnt = cnt-k;
            k = 2*k;
        }
        ZP(cnt*cost,cnt*wei);
    }
}
int main()
{
    int n;
    while(~scanf("%d%d",&n,&v),n+v)
    {
        int i;
        for(i = 0;i<n;i++)
        scanf("%d",&c[i]);
        for(i = 0;i<n;i++)
        scanf("%d",&w[i]);
        for(int i=1;i<=v;i++)
            dp[i]=0;
        for(i = 0;i<n;i++)
        {
            MP(c[i],c[i],w[i]);
        }
        int sum = 0;
        for(i=1;i<=v;i++)
        {
            if(dp[i]==i)
            {
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}