HDU 2844【背包】
来源:互联网 发布:淘宝金皇冠店值多少钱 编辑:程序博客网 时间:2024/06/14 16:17
Coins
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 63 Accepted Submission(s) : 27
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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.
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<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<climits>#include<string>#include<queue>#include<stack>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define MS(x,y)memset(x,y,sizeof(x))typedef long long LL;const int INF =0x7FFFFFFF;const int MAX=100000;int dp[MAX];int c[MAX],w[MAX];int v;void ZeroOnePack(int cost,int wei){ int i; for(i = v;i>=cost;i--) { dp[i] = max(dp[i],dp[i-cost]+wei); }}void CompletePack(int cost,int wei){ int i; for(i = cost;i<=v;i++) { dp[i] = max(dp[i],dp[i-cost]+wei); }}void MultiplePack(int cost,int wei,int cnt){ if(v<=cnt*cost) { CompletePack(cost,wei); return ; } else { int k = 1; while(k<=cnt) { ZeroOnePack(k*cost,k*wei); cnt = cnt-k; k = 2*k; } ZeroOnePack(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]); memset(dp,0,sizeof(dp)); for(i = 0;i<n;i++) { MultiplePack(c[i],c[i],w[i]); } int sum = 0; for(i = 1;i<=v;i++) { if(dp[i]==i) { sum++; } } printf("%d\n",sum); } return 0;}
0 0
- hdu 2844 DP 背包
- HDU-2844 多重背包
- hdu 2844 Coins 背包
- hdu 2844(背包)
- hdu 2844 多重背包
- hdu 2844 多重背包
- hdu 2844 多重背包
- hdu 2844 多重背包
- hdu 2844 多重背包
- HDU 2844 (多重背包)
- HDU 2844【背包】
- hdu 2844(多重背包)
- hdu 2844 多重背包
- HDU 2844 (多重背包)
- hdu 2844(多重背包)
- HDU-2844 Coins (多重背包+完全背包)
- hdu 2844 Coins 多重背包
- hdu 2844 Coins 多重背包
- 【iOS开发】Xib的使用与File's Owner总结
- 【iOS开发】NSPredicate
- 【Mac技巧】查看mac电脑wifi(局域网)网络地址快捷键
- 【数据结构和算法】java 队列实现
- 【iOS开发】字符串汉字转拼音
- HDU 2844【背包】
- POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover
- 【Python学习】python+Eclipse+MySQLdb安装
- Python 标准异常总结
- 【iOS开发】Xcode修改中文配置
- 【iOS开发】SDWebImage框架,加载图片,失败之后,居然直接跳过不再去请求网络数据了?
- 【iOS开发】SDWebImage option(参数)
- 【iOS开发】用instruments来检验你的app
- Linux 安装 rlwrap工具