hdu 1085 Holding Bin-Laden Captive!

最新推荐文章于 2020-11-10 20:31:37 发布

原创最新推荐文章于 2020-11-10 20:31:37 发布 · 322 阅读

0 ·

CC 4.0 BY-SA版权

母函数专栏收录该内容

0 篇文章

订阅专栏

本文揭示了恐怖分子本·拉登隐藏在中国杭州后，为了摆脱恐惧，将自己投入到数学问题中。他的挑战是：给定三种不同面额的硬币（1元、2元、5元），分别有num_1、num_2、num_5枚，求出不能用这些硬币支付的最小正金额。作为超级ACMer，您应轻松解决此问题，并记得从布什那里拿走2500万美元。

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

1 1 3
0 0 0

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 );
         }
}