hdoj 1085 Holding Bin-Laden Captive! <思维>
来源:互联网 发布:数据审计追踪 编辑:程序博客网 时间:2024/06/06 00:59
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20230 Accepted Submission(s): 9015
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
代码:
#include<cstdio>#define MA 9000bool fafe[MA];int shu[MA],ge;int main(){ int a,b,c; while (scanf("%d%d%d",&a,&b,&c),a+b+c) { if (a==0) { printf("1\n"); continue; } int kp=a+2*b+1; for (int i=0;i<kp;i++) shu[i]=1; if (kp<5) { printf("%d\n",kp); } else printf("%d\n",kp+c*5); } return 0;}
0 0
- hdoj 1085 Holding Bin-Laden Captive! <思维>
- HDOJ 1085 Holding Bin-Laden Captive
- hdu/hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- HDOJ HDU 1085 Holding Bin-Laden Captive!
- HDOJ Holding Bin-Laden Captive!
- 1085 Holding Bin-Laden Captive!
- HDOJ/HDU 1085 母函数 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!(母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive! (母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
- 母函数之 Holding Bin-Laden Captive! hdoj 1085
- Holding Bin-Laden Captive! 【HDOJ-1085-母函数】
- HDOJ-1085-Holding Bin-Laden Captive! 解题报告
- HDOJ Holding Bin-Laden Captive! 1085【母函数】
- hdoj 1085 Holding Bin-Laden Captive!【基础母函数】
- Introducing Kafka Streams: Stream Processing Made Simple
- Redis的分片、预分片技术总结
- codeforces No to Palindromes!(字符串处理,不能有回文)
- 2016多校联合第二场 HDU5739 Fantasia 解题报告
- java使用ajax实现进度条
- hdoj 1085 Holding Bin-Laden Captive! <思维>
- C++文件的读写
- Informix11.70培训笔记(3)
- 数据库基础知识
- 连载:面向对象葵花宝典:思想、技巧与实践(14) - 面向对象开发技术流程
- Golang1.7使用ICMP协议实现ping功能,带TIME和TTL
- 怎样提高程序员的软实力,走上人生巅峰(http://bbs.jointforce.com/topic/17845?ref=myread)
- 03智力题
- 关于iOS生命周期和前后台的切换