hdu 1085 Holding Bin-Laden Captive!
来源:互联网 发布:java list 泛型 编辑:程序博客网 时间:2024/05/17 02:11
Holding Bin-Laden Captive!
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 45 Accepted Submission(s) : 13
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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!
“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 30 0 0
Sample Output
4
Author
#include<stdio.h>int main(){int c1[10000], c2[10000];int a[4]; int i, j, k, sum; int c[3] = {1,2,5}; while( scanf("%d %d %d", &a[0], &a[1], &a[2] ) != EOF&&(a[0]||a[1]||a[2]) ) { sum= a[0]+a[1]*2+a[2]*5; for( i=0; i<= sum; i++ ) c1[i] = c2[i] =0; for( i=0; i<= a[0]; i++ ) c1[i] =1; for( i=1; i<=2; i++ ) { for( j=0; j<= sum; j++ ) { for( k=0; k<= a[i]*c[i] && k+j<= sum; k+= c[i] ) { c2[k+j] += c1[j]; } } for( j=0; j<= sum; j++ ) { c1[j] = c2[j]; c2[j] =0; } } for( i=1; i<= sum; i++ ) if( c1[i] ==0) break; printf("%d\n", i); } return 0;}
- hdu 1085 Holding Bin-Laden Captive!
- HDU 1085 - Holding Bin-Laden Captive!
- HDU 1085 Holding Bin-Laden Captive!
- HDU 1085 Holding Bin-Laden Captive
- HDU 1085 Holding Bin-Laden Captive!
- Hdu 1085 - Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- Holding Bin-Laden Captive! hdu 1085
- hdu/hdoj 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- hdu 1085 Holding Bin-Laden Captive!
- HDU 1085 Holding Bin-Laden Captive!
- c++学习之容器——erase()函数
- 备忘日志【六】
- 进程上下文和中断上下文的区别
- fafu1267 - 堆排序
- 特征选择常用算法综述
- hdu 1085 Holding Bin-Laden Captive!
- UVA167
- IOS url encode
- Erlang学习记录(三)——表达式大集合
- 随笔(二)
- Android 远程Service通信
- 编写高质量代码:改善C++程序的150个建议(十)
- Asp.Net生命周期系列六
- 网络游戏程序员须知 UDP vs TCP