zoukankan      html  css  js  c++  java
  • HDU 1085 Holding BinLaden Captive!

    Holding Bin-Laden Captive!

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


    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
     1 #include<stdio.h>
    2 #include<string.h>
    3 int value[4] = {0,1,2,5} , c1[10000] , c2[10000];
    4 int num[4] , sum ;
    5 int main ()
    6 {
    7 while ( scanf ( "%d%d%d" , &num[1] , &num[2] , &num[3] ) , num[1] ||num[2] || num[3] )
    8 {
    9 sum = num[1] * 1 + num[2] * 2 + num[3] * 5 ;
    10 for ( int i = 0 ; i <= sum ; ++ i )
    11 {
    12 c1[i] = 0 ;
    13 c2[i] = 0 ;
    14 }
    15 for ( int i = 0 ; i <= num[1] ; ++ i )
    16 c1[i] = 1 ;
    17 for ( int i = 0 ; i <= num[1]*1 ; ++ i )
    18 for ( int j = 0 ; j <= num[2]*2 ; j += 2 )
    19 c2[j+i] += c1[i] ;a
    20 for ( int i = 0 ; i <= num[2]*2+num[1]*1 ; ++ i )
    21 {
    22 c1[i] = c2[i] ;
    23 c2[i] = 0 ;
    24 }
    25 for ( int i = 0 ; i <= num[1]*1+num[2]*2 ; ++ i )
    26 for ( int j = 0 ; j <= num[3]*5 ; j += 5 )
    27 c2[j+i] += c1[i] ;
    28 for ( int i = 0 ; i <= num[1]*1+num[2]*2+num[3]*5 ; ++i )
    29 {
    30 c1[i] = c2[i] ;
    31 c2[i] = 0 ;
    32 }
    33 int pos ;
    34 for ( pos = 0 ; pos <= sum ; ++ pos )
    35 {
    36 if ( c1[pos] == 0 )
    37 {
    38 printf ( "%d\n" , pos ) ;
    39 break ;
    40 }
    41 }
    42 if ( pos == sum + 1 )
    43 printf ( "%d\n" , pos ) ;
    44 }
    45 return 0 ;
    46 }

      

    Author

    lcy

  • 相关阅读:
    js 中 undefined 和null 的区别
    【Gym103107E/黑龙江省赛16thE】Elastic Search(Trie树性质+ac自动机性质)
    不等概率抽卡的毕业期望次数
    博客园无法用IE进行登录
    Web项目开发小结
    各位看官,自己觉着喜欢的存到手机里面
    MVC控制器执行重定向
    吐了个槽o.o
    浏览器设置不缓存的方法
    关于A+B
  • 原文地址:https://www.cnblogs.com/jbelial/p/2119620.html
Copyright © 2011-2022 走看看