首页 > 代码库 > 1085
1085
Holding Bin-Laden Captive! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14095 Accepted Submission(s): 6309 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> #include<stdio.h> using namespace std; int c1[10000], c2[10000]; int num[4]; int main() { int nNum; while(scanf("%d %d %d", &num[1], &num[2], &num[3]) && (num[1]||num[2]||num[3])) { int _max = num[1]*1+num[2]*2+num[3]*5; // 初始化 for(int i=0; i<=_max; ++i) { c1[i] = 0; c2[i] = 0; } for(int i=0; i<=num[1]; ++i) c1[i] = 1; for(int i=0; i<=num[1]; ++i) for(int j=0; j<=num[2]*2; j+=2) c2[j+i] += c1[i]; for(int i=0; i<=num[2]*2+num[1]*1; ++i) { c1[i] = c2[i]; c2[i] = 0; } for(int i=0; i<=num[1]*1+num[2]*2; ++i) for(int j=0; j<=num[3]*5; j+=5) c2[j+i] += c1[i]; for(int i=0; i<=num[2]*2+num[1]*1+num[3]*5; ++i) //看到变化了吗 { c1[i] = c2[i]; c2[i] = 0; } int i; for(i=0; i<=_max; ++i) if(c1[i] == 0) { printf("%d\n", i); break; } if(i == _max+1) printf("%d\n", i); } return 0; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。