hdu 1085 Holding Bin-Laden Captive!
2015-08-22 20:18
417 查看
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!
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
Sample Output
代码:
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int a, b ,c;
while( true )
{
scanf( "%d %d %d", &a, &b, &c );
if( a==0 && b==0 && c==0 )
break;
if( a==0 )
printf( "1\n" );
else if( a+2*b<4 )
printf( "%d\n", a+2*b+1 );
else
printf( "%d\n", a+2*b+5*c+1 );
}
}
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!
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 3 0 0 0
Sample Output
4
代码:
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int a, b ,c;
while( true )
{
scanf( "%d %d %d", &a, &b, &c );
if( a==0 && b==0 && c==0 )
break;
if( a==0 )
printf( "1\n" );
else if( a+2*b<4 )
printf( "%d\n", a+2*b+1 );
else
printf( "%d\n", a+2*b+5*c+1 );
}
}
相关文章推荐
- poj 3687 拓扑逆排 @
- 暑假- -
- Java集合Set、List、Map的遍历方法
- UVa:11491 Erasing and Winning(单调栈)
- js中的property和attribute
- 的天数,以一个日期与当前日期的
- i++是否原子操作?并解释为什么???????
- i++是否原子操作?并解释为什么???????
- 完全背包
- poj 1094 拓扑
- TYVJ 1001 第K极值
- https实现的几个问题
- 通过java的反射从list中取出对象从而取出属性值
- 什么什么01
- 获得二叉树深度的非递归实现
- 程序员笔试面试常见题总结,更新ing
- poj 1698 二分图多重匹配
- 位级运算的一些事
- Android-基本控件(AutoCompleteTextView,MultiAutoCompleteTextView,ToggleButton)
- 路径(path)题解