HDU 2844 Coins 多重背包
来源:互联网 发布:mac隐藏windows分区 编辑:程序博客网 时间:2024/05/16 15:06
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10236 Accepted Submission(s): 4083
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
Source
2009 Multi-University Training Contest 3 - Host by WHU
Recommend
gaojie | We have carefully selected several similar problems for you: 2159 2955 1203 1171 1864
套模板
ACcode:
#pragma warning(disable:4786)//使命名长度不受限制#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈#include <map>#include <set>#include <queue>#include <cmath>#include <stack>#include <cctype>#include <cstdio>#include <cstring>#include <stdlib.h>#include <iostream>#include <algorithm>#define rd(x) scanf("%d",&x)#define rd2(x,y) scanf("%d%d",&x,&y)#define rds(x) scanf("%s",x)#define rdc(x) scanf("%c",&x)#define ll long long int#define maxn 100000+10#define mod 1000000007#define INF 0x3f3f3f3f //int 最大值#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)#define MT(x,i) memset(x,i,sizeof(x))#define PI acos(-1.0)#define E exp(1)using namespace std;int Max(int a,int b){return a>b?a:b;}int c[maxn],w[maxn],num[maxn],f[maxn];///c:费用 w:价值 num:int V,n,m;void ZeroOnePack(int c,int w){ for(int v=V;v>=c;v--) f[v]=Max(f[v],f[v-c]+w);}void CompletePack(int c,int w){ for(int v=c;v<=V;v++) f[v]=Max(f[v],f[v-c]+w);}void MultiplePack(int c,int w,int nl){ if(c*nl>=V) CompletePack(c,w); else { int k=1; while(k<nl){ ZeroOnePack(k*c,k*w); nl-=k;k<<=1; } ZeroOnePack(nl*c,nl*w); }}int main(){ while(rd2(n,m),(n+m)){ V=m;MT(f,0); FOR(i,1,n)rd(c[i]); FOR(i,1,n)rd(num[i]); FOR(i,1,n) MultiplePack(c[i],c[i],num[i]); int cc=0; FOR(i,1,m)if(i==f[i])cc++; printf("%d\n",cc); } return 0;}/*3 101 2 4 2 1 12 51 4 2 1*/
0 0
- hdu 2844 Coins 多重背包
- hdu 2844 Coins 多重背包
- HDU 2844 Coins -- 多重背包
- hdu 2844 Coins - 多重背包
- hdu 2844 Coins(多重背包)
- hdu 2844 Coins 多重背包
- Coins hdu 多重背包 2844
- HDU 2844 Coins 多重背包
- HDU-2844-Coins(多重背包)
- HDU 2844 Coins(多重背包)
- HDU 2844:Coins(多重背包)
- HDU 2844(Coins)多重背包
- hdu 2844 Coins (多重背包)
- HDU - 2844 Coins(多重背包)
- HDU 2844 Coins 多重背包
- hdu 2844 coins 多重背包
- hdu 2844 Coins【多重背包】
- HDU 2844-Coins(多重背包)
- 第一个包含类的C++程序
- Android 微信授权登录、获取Wx用户信息,解决无法回调问题
- Swift中推送通知设置:Binary operator '|' cannot be applied to two UIUserNotificationType operands 错误解决
- android开发工具类之获得WIFI IP地址或者手机网络IP
- LeetCode Palindrome Number
- HDU 2844 Coins 多重背包
- ios学习之spritekit的简单学习
- 【Little_things】控制台五子棋(java)
- 杭电1106--替换空格
- session的使用
- Java语言使用注解处理器生成代码——第三部分:生成源代码
- uva 1354——Mobile Computing
- 大数相乘
- unity里的几个控件说明