hdoj1085
来源:互联网 发布:淘宝的超级会员的好处 编辑:程序博客网 时间:2024/05/27 20:57
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9113 Accepted Submission(s): 4103
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<stdio.h>int main(void) { int num1, num2, num5; while (scanf("%d%d%d", &num1, &num2, &num5), num1 + num2 + num5) { if (num1 == 0) printf("1\n"); else if (num1 + 2 * num2 < 4) printf("%d\n", num1 + num2 * 2 + 1); else printf("%d\n", num1 + num2 * 2 + num5 * 5 + 1); } return 0;}
- hdoj1085
- HDOJ1085
- HDOJ1085
- HDOJ1085母函数的应用
- hdoj1085 Holding Bin-Laden Captive!(又见母函数)
- CSV无法加载全部(超过65535行!!!)
- ruby数组总结
- LEADER?
- fckeditor上传文件设置
- Filestream读写文件
- hdoj1085
- 关于avconv.c中的config.h
- Hadoop-0.20.0分布式集群配置
- 转载--tcpdump 抓包让wireshark来分析---
- QT中实现Thread与GUI主线程连通方法
- 人工蜂群算法简介
- VisionMobile:2012年移动开发者经济报告(十):五、走向本地化(上)
- POJ 题目分类(二)
- Oracle 数据库导入导出和windows环境下的oracle服务