hdu1085 Holding Bin-Laden Captive! (多重背包)
来源:互联网 发布:python 首字母小写 编辑:程序博客网 时间:2024/05/20 16:13
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18710 Accepted Submission(s): 8329
Problem Description
We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China!
“Oh, God! How terrible! ”
Don’t be so afraid, guys. Although he hides in a cave of Hang Zhou, he dares not to go out. Laden is so bored recent years that he fling himself into some math problems, and he said that if anyone can solve his problem, he will give himself up!
Ha-ha! Obviously, Laden is too proud of his intelligence! But, what is his problem?
“Given some Chinese Coins (硬币) (three kinds-- 1, 2, 5), and their number is num_1, num_2 and num_5 respectively, please output the minimum value that you cannot pay with given coins.”
You, super ACMer, should solve the problem easily, and don’t forget to take $25000000 from Bush!
“Oh, God! How terrible! ”
Don’t be so afraid, guys. Although he hides in a cave of Hang Zhou, he dares not to go out. Laden is so bored recent years that he fling himself into some math problems, and he said that if anyone can solve his problem, he will give himself up!
Ha-ha! Obviously, Laden is too proud of his intelligence! But, what is his problem?
“Given some Chinese Coins (硬币) (three kinds-- 1, 2, 5), and their number is num_1, num_2 and num_5 respectively, please output the minimum value that you cannot pay with given coins.”
You, super ACMer, should solve the problem easily, and don’t forget to take $25000000 from Bush!
Input
Input contains multiple test cases. Each test case contains 3 positive integers num_1, num_2 and num_5 (0<=num_i<=1000). A test case containing 0 0 0 terminates the input and this test case is not to be processed.
Output
Output the minimum positive value that one cannot pay with given coins, one line for one case.
Sample Input
1 1 30 0 0
Sample Output
4
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1171 2152 2082 1709 2079
代码:
#include<cstdio>#include<cstring>#define ms(a) memset(a,0,sizeof(a))using namespace std;const int maxn=8e3;int a[]={1,2,5},s[4];bool f[maxn+10];int main(){ freopen("1.in","r",stdin); int i,j,k,len; while(scanf("%d%d%d",&s[0],&s[1],&s[2]),s[0]+s[1]+s[2]) { if(s[0]==0) { printf("%d\n",1); continue;} len=s[0]+2*s[1]+5*s[2]; ms(f),f[0]=1; for(i=0;i<=2;i++) for(j=1;j<=s[i];j++) for(k=len;k>=a[i];k--)f[k]=f[k]|f[k-a[i]]; for(i=1;i<=len;i++)if(!f[i])break; printf("%d\n",i);} return 0;}
0 0
- hdu1085 Holding Bin-Laden Captive! (多重背包)
- hdu1085-Holding Bin-Laden Captive!
- hdu1085 Holding Bin-Laden Captive!
- hdu1085 Holding Bin-Laden Captive!
- HDU1085 Holding Bin-Laden Captive!
- HDU1085 Holding Bin-Laden Captive!
- hdu1085(Holding Bin-Laden Captive!)
- hdu1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive! (多重背包变形)
- HDU1085 Holding Bin-Laden Captive!(母函数)
- HDU1085 Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!(hdu1085)——母函数
- HDU1085 Holding Bin-Laden Captive!,母函数
- HDU1085 Holding Bin-Laden Captive! 【母函数】
- hdu1085——Holding Bin-Laden Captive!
- 【HDU1085】Holding Bin-Laden Captive! 母函数
- Holding Bin-Laden Captive!(母函数或多重背包)
- HDU 1085 Holding Bin-Laden Captive!【母函数||多重背包】
- com/opensymphony/xwork2/spring/SpringObjectFactory.java:220:-1问题出现的原因及解决办法
- numpy 基础知识
- Wix学习整理(2)——HelloWorld安装添加UI
- UIPageViewController 专辑
- 第13周项目2-Kruskal算法的验证
- hdu1085 Holding Bin-Laden Captive! (多重背包)
- putty(ssh)无法登陆linux(bt5)解决方案
- Linux makefile 教程 非常详细,且易懂
- java提高篇(五)-----使用序列化实现对象的拷贝
- fixedz闪动问题深度总结~~
- schema 约束
- WPF 手绘进度条
- java提高篇(六)-----关键字static
- 如何使用Eclipse在全应用中集成移动广告平台SDK 并在应用中展示横幅广告