hdu2844 多重背包
来源:互联网 发布:linux修改host科学上网 编辑:程序博客网 时间:2024/05/29 12:36
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16051 Accepted Submission(s): 6389
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
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[123],c[123],dp[111111];bool vis[1111111];void beg01(int V,int v,int w){ for(int i=V;i>=v;i--){ dp[i]=max(dp[i],dp[i-v]+w); }}void begcm(int V,int v,int w){ for(int i=v;i<=V;i++){ dp[i]=max(dp[i],dp[i-v]+w); }}void begmu(int V,int v,int w,int num){ if(num*v>V){ begcm(V,v,w); return; } int k=1; while(k<=num){ beg01(V,k*v,k*w); num-=k; k=k*2; } beg01(V,num*v,num*w);}int main() { int n,m; while(~scanf("%d %d",&n,&m)){ if(n==0&&m==0) break; memset(dp,0,sizeof(dp)); memset(vis,false,sizeof(vis)); for(int i=0;i<n;i++){ scanf("%d",a+i); } for(int i=0;i<n;i++){ scanf("%d",c+i); } for(int i=0;i<n;i++){ begmu(m,a[i],a[i],c[i]); } int h=0; for(int i=0;i<=m;i++){ if(!vis[dp[i]]&&dp[i]!=0){ vis[dp[i]]=1; h++; } } printf("%d\n",h); } return 0;}
- hdu2844 多重背包
- HDU2844:Coins(多重背包)
- hdu2844(多重背包)
- hdu2844 Coins 多重背包
- hdu2844 Coins --多重背包
- hdu2844 多重背包
- hdu2844多重背包简单应用
- hdu2844 Coins(多重背包)
- HDU2844-Coins(多重背包)
- hdu2844 多重背包+二进制优化
- HDU2844 Coins(多重背包)
- hdu2844 Coins 多重背包+完全背包
- hdu2844 完全背包+多重背包(经典)
- hdu2844 Coins(多重背包+二进制优化)
- hdu2844 Coins (多重背包+二进制优化)
- hdu2844—Coins(多重背包)
- 动态规划--多重背包--hdu2844 coins
- hdu2844 Coins(多重背包模板题)
- Cookie工具类
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- PHP命名空间(Namespace)的使用详解
- 去除steamvr中script自带的图标
- 笔记,通用mapper
- hdu2844 多重背包
- Defense Lines UVA
- UVA
- POJ3461【1e6 字符串 hash模板】
- oracle插入多条语句(转载的)
- maven 远程仓库连接阿里setting设置
- MySQL必知必会知识点总结
- 我的svg案例1
- 0-使用IDEA创建java程序