Coins(多重背包+二进制优化)
来源:互联网 发布:oracle数据库面试题 编辑:程序博客网 时间:2024/06/05 08:08
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9658 Accepted Submission(s): 3843
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<iostream>#include<cstring>using namespace std;int v[105],num[105];int dp[100010];int main(){ int i,j,k,n,m,tmp,sum; while(cin>>n>>m,(m+n)) { sum=0; memset(dp,0,sizeof(dp)); dp[0]=1; for(i=1;i<=n;i++) { cin>>v[i]; } for(i=1;i<=n;i++) { cin>>num[i]; } for(i=1;i<=n;i++) { for(j=1;j<=num[i];j*=2) { tmp=j*v[i]; for(k=m;k>=tmp;k--) { if(dp[k-tmp]) { dp[k]=1; } } num[i]-=j; } tmp=num[i]*v[i]; if(tmp) { for(k=m;k>=tmp;k--) { if(dp[k-tmp]) { dp[k]=1; } } } } for(j=1;j<=m;j++) { if(dp[j]) { sum++; } } cout<<sum<<endl; }}
0 0
- Coins(多重背包+二进制优化)
- hdu2844 Coins(多重背包+二进制优化)
- hdu 2844 Coins(多重背包+二进制优化)
- HDU 2844 Coins (多重背包+二进制优化模板)
- hdu 2844 Coins(dp 多重背包 二进制优化)
- HDU 2844 Coins (二进制优化多重背包)
- HDU 2844 Coins 多重背包(二进制优化)
- HDU 2844 Coins(多重背包【二进制优化】)
- HDU-2844-Coins(多重背包 二进制优化)
- 动态规划:HDU2844-Coins(多重背包的二进制优化)
- hdu 2844 Coins(多重背包+二进制优化)
- hdu 2844 Coins(多重背包+二进制优化)
- hdu 2844 Coins 多重背包+二进制优化
- hdu 2844 coins (多重背包+二进制优化)
- Coins (HDU_2844) 二进制优化+多重背包
- hdu2844 Coins (多重背包+二进制优化)
- hdu-2844-Coins (多重背包+二进制优化)
- HDU 2844 Coins(多重背包 + 二进制优化 + 01背包)
- Android中Activity四种启动模式和taskAffinity属性详解
- Codeforces 551 D. GukiZ and Binary Operations
- [web安全] 其他小众类型输入攻击
- 归并排序 java语言实现
- 拓扑排序简单题
- Coins(多重背包+二进制优化)
- bzoj-3143 游走
- 九度oj 1445
- 黑马程序员——自学java基础第一天
- 【Spring Security】之一:Eclipse搭建Spring Security项目
- AndroidDevTools
- hdu 5329 Question for the Leader 枚举,划分图为k个联通的子图
- 栈的压入、弹出序列
- 随手记