zoukankan      html  css  js  c++  java
  • HDU1085 Holding Bin-Laden Captive!

    Holding Bin-Laden Captive!

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 13132    Accepted Submission(s): 5882



    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
    4
    #include <iostream>
    
    using namespace std;
    
    int main()
    {
        int a,b,c;
        while(cin>>a>>b>>c)
        {
            if(!a&&!b&&!c)
                break;
            int v[3000];
            for(int i=0; i<a; i++)
                v[i]=1;
            for(int i=a; i<a+b; i++)
                v[i]=2;
            for(int i=a+b; i<a+b+c; i++)
                v[i]=5;
            int sum=0;
            for(int i=0;i<a+b+c;i++)
            {
                if(sum+1<v[i])
                break;
                sum+=v[i];
            }
            cout<<sum+1<<endl;
        }
        return 0;
    }
    
    //从小到大的顺序叠加,如果他们的和+1还小于下一个数就相当于出现断面。即可算出最小值。
    
  • 相关阅读:
    SQLServer DMV Query
    SQL Server Logical/Physical Reads
    The include feature of SQL Server Index
    数据库教程:数据库常用对象
    数据库教程:数据库组成
    数据库教程(一):基本概念
    C#编程:依赖倒置原则DIP
    C#编程:AOP编程思想
    ASP.NET Core Web服务器
    DataTable实现分组
  • 原文地址:https://www.cnblogs.com/unclejelly/p/4082115.html
Copyright © 2011-2022 走看看