多重背包

原题http://acm.hdu.edu.cn/showproblem.php?pid=2844

Coins

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

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

#include <stdio.h>#include <stdlib.h>#include <ctype.h>#include <limits.h>#include <malloc.h>#include <string.h>#include <string>#include <math.h>#include <algorithm>#include <iostream>#include <queue>#include <stack>#include <deque>#include <vector>#include <set>#include <map>using namespace std;const int maxn = 101;int n,m,ans,num[maxn],c[maxn],dp[100010];void CompletePack(int cost,int weight){//完全背包    for(int i=cost;i<=m;i++){//注意与01背包的顺序关系        dp[i] = max(dp[i],dp[i-cost]+weight);    }}void ZeroOnePack(int cost,int weight){//01背包    for(int i=m;i>=cost;i--){        dp[i] = max(dp[i],dp[i-cost]+weight);    }}void MultiplyPack(int cost,int weight,int amount){    if(cost*amount >= m){//如果大于等于m就按照完全背包处理        CompletePack(cost,weight);    }    else{        int k = 1;        while(k < amount){            ZeroOnePack(k*cost,k*weight);            amount-=k;            k<<=1;        }        ZeroOnePack(amount*cost,amount*weight);    }}int main(){    while(~scanf("%d%d",&n,&m)){        if(n==0 && m==0){            break;        }        ans = 0;        memset(dp,0,sizeof(dp));        int i;        for(i=0;i<n;i++){            scanf("%d",&c[i]);        }        for(i=0;i<n;i++){            scanf("%d",&num[i]);        }        for(i=0;i<n;i++){            MultiplyPack(c[i],c[i],num[i]);        }        for(i=1;i<=m;i++){            if(dp[i] == i){                ans++;            }        }        printf("%d\n",ans);    }    return 0;}