HDU2844 Coins
来源:互联网 发布:全国人口数据库 编辑:程序博客网 时间:2024/05/21 12:43
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14198 Accepted Submission(s): 5649
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
一道多重背包题目,最后计算出能够放进背包的所有可能的结果即可。
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int v[105],b[105],n,m,vis[100005],f[100005];void ZeroOnePack(int weight, int cost){ for(int v = m; v >= cost; v --){ f[v] = max(f[v],f[v-cost]+weight); }}void CompletePack(int weight, int cost){ for(int v = cost; v <= m; v ++){ f[v] = max(f[v],f[v-cost]+weight); }}void MultiplePack(int weight, int cost, int amount){ if(cost * amount >= m){ CompletePack(weight,cost); } else{ for(int k = 1; k < amount; k *= 2){ ZeroOnePack(k*weight,k*cost); amount -= k; } ZeroOnePack(amount*weight,amount*cost); }}int main(){ while(~scanf("%d%d",&n,&m)){ if(!m && !n) break; for(int i = 0; i <= m; i ++){ f[i] = vis[i] = 0; } for(int i = 0; i < n; i ++){ scanf("%d",&v[i]); } for(int i = 0; i < n; i ++){ scanf("%d",&b[i]); } for(int i = 0; i < n; i ++){ MultiplePack(v[i],v[i],b[i]); } int cnt = 0; for(int i = 1; i <= m; i ++){//记录有哪些小于等于m的数字出现 vis[f[i]] ++; } for(int i = 1; i <= m; i ++){//判断小于等于m的数字是否出现 if(vis[i]) cnt ++; } printf("%d\n",cnt); } return 0;}
0 0
- HDU2844 Coins
- hdu2844 Coins
- HDU2844:Coins
- hdu2844 Coins
- HDU2844 Coins
- HDU2844:Coins
- hdu2844 Coins
- HDU2844:Coins(多重背包)
- hdu2844 Coins 多重背包
- hdu2844 Coins --多重背包
- hdu2844 Coins(DP)
- hdu2844 Coins(多重背包)
- HDU2844-Coins(多重背包)
- POJ 1742/HDU2844 Coins 题解
- HDU2844 Coins(多重背包)
- hdu2844 Coins 多重背包+完全背包
- hdu2844 Coins(多重背包+二进制优化)
- hdu2844 Coins (多重背包+二进制优化)
- typedef 枚举 联合体 条件运算符和表达式
- libevent入门
- python实现傅立叶级数展开
- 封装
- eclipse自动补全的设置
- HDU2844 Coins
- 数论
- Ubuntu下Python 3.3的安装
- 子集选择
- RSA公钥私钥的简单实现
- USACO 2.3 货币系统(背包/生成函数)
- 区域内点的个数
- 隐藏底部虚拟导航栏
- UESTC395 Dynamic Query System 【简单平衡树(数组Treap)】