hdu 2844 Coins(多重背包)
来源:互联网 发布:怎么查看数据库ip地址 编辑:程序博客网 时间:2024/04/26 06:51
http://acm.hdu.edu.cn/showproblem.php?pid=2844
Coins
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
题目意思是求出硬币的组合方案,使得硬币的总价值不超过价值m。
DP问题,可以转换成求多重背包的方案数目。
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <queue>#include <stack>#include <vector>#include <map>using namespace std;#define N 140000#define INF 0x3f3f3f3f#define PI acos (-1.0)#define EPS 1e-8#define met(a, b) memset (a, b, sizeof (a))typedef long long LL;int dp[N];char vis[N];int main (){ int n, m, v[N], c[N]; while (scanf ("%d %d", &n, &m), n+m) { int cnt = 0; for (int i=1; i<=n; i++) scanf ("%d", &v[i]); for (int j=1; j<=n; j++) scanf ("%d", &c[j]); met (vis, 0); vis[0] = true; for (int i=1; i<=n; i++) { met (dp, 0); for (int j=v[i]; j<=m; j++) { if (!vis[j] && vis[j-v[i]] && dp[j-v[i]] < c[i]) { vis[j] = true;//记录当前这个价值是否出现过 dp[j] = dp[j-v[i]] + 1;//记录用金币的数量 cnt++; } } } printf ("%d\n", cnt); } return 0;}
0 0
- HDU 2844 Coins(多重背包)
- hdu 2844 Coins (多重背包)
- hdu 2844 Coins(多重背包优化)
- [ACM] hdu 2844 Coins (多重背包)
- 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 多重背包
- 设计算法1
- Mac OSX10.11更新后sudo竟然不能写/bin,/usr/bin /usr/sbin等系统目录了。
- Firebase 特性翻译
- textview多行文本后加上图片
- eq,neq,gt,lt等表达式缩写
- hdu 2844 Coins(多重背包)
- 冒泡排序
- oscache入门 缓存
- iOS开发通过代码方式使用AutoLayout (NSLayoutConstraint + Masonry)
- 小记Matlab和C混合编程
- 希尔排序
- AngularJs 一些心得
- Android 编程下 shape 绘制图形
- 用C语言实现对冗余层发送的数据包进行过滤判断处理