杭电 1085
来源:互联网 发布:linux下安装中文字体 编辑:程序博客网 时间:2024/04/29 19:05
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14670 Accepted Submission(s): 6566
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
lcy
母函数的变形;求出来每个的种类数,存入数组中,之后再判断是否为零就行了,
当然也有个简单的办法,就是观察是否能够超出四,这样更简单,代码更短,但是,就是不太容易想得出来:
简单的方法的代码如下:
<span style="font-size:14px;">#include<stdio.h>int main(){int a,b,c;while(~scanf("%d%d%d",&a,&b,&c),a+b+c){if(a==0){printf("1\n");}else if(a+2*b<4){printf("%d\n",a+b*2+1);}else printf("%d\n",a+2*b+5*c+1);}return 0;}</span>
至于母函数的代码也贴出来如下:
<span style="font-size:14px;">#include<stdio.h>int c1[10100],c2[10100];int main(){int i,j,a,b,c;while(~scanf("%d%d%d",&a,&b,&c),a+b+c){int sum=a+b*2+c*5;for(i=0;i<=sum;i++)c1[i]=c2[i]=0;for(i=0;i<=a;i++)c1[i]=1;for(i=0;i<=a;i++)for(j=0;j<=2*b;j+=2)c2[i+j]+=c1[i];for(j=0;j<=sum;j++)c1[j]=c2[j],c2[j]=0;for(i=0;i<=a+2*b;i++)for(j=0;j<=5*c;j+=5)c2[i+j]+=c1[i];//起初在这个地方,将i写成了j结果wa了好几回for(j=0;j<=a+2*b+5*c;j++)c1[j]=c2[j],c2[j]=0;for(j=0;j<=sum;j++){if(c1[j]==0){printf("%d\n",j);break;}} if(j>=sum+1)printf("%d\n",j);}return 0;}</span>
0 0
- 杭电1085
- 杭电1085
- 杭电 1085
- 杭电1085
- 杭电
- 杭电
- 杭电
- 杭电(1085)Holding Bin-Laden Captive!
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- 杭电ACM1225
- 杭电ACM2023
- Linux的less命令简介
- SDI与ASI 接口详解介绍
- nodejs中使用monk访问mongodb
- 分享HTML5游戏开发的5条实用建议
- 高效的物流体系,应该如何来建设?
- 杭电 1085
- 我的NodeJs学习小结(一)
- ZOJ 3792 Romantic Value 最小割
- RK29 Camare移植--内核部分
- 基于promise.js实现nodejs的promises库
- effective java确实是一本神奇的书籍
- Node.js与PHP、Python的字符处理性能对比
- .net framework2.0,3.0,3.5的CookieContainer的bug解决方法
- lua替换CCSprite的图片