hdu 1085(普通型母函数)
来源:互联网 发布:无权限新建数据库 编辑:程序博客网 时间:2024/05/11 15:54
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8592 Accepted Submission(s): 3856
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
题目类型:普通型母函数
题目描述:略
题目分析:裸
代码如下:
#include <stdio.h>#include <memory.h>#define N 8001int r[N];int t[N];int x[3] = {1,2,5};int c[3];int Max;int result;void init(){ memset(r,0,sizeof(r[0])*(Max+1)); memset(t,0,sizeof(t[0])*(Max+1)); int i,j,k; for( i = 0; i <= c[0]; i++){ r[i] = 1; } for( k = 1; k <= 2; k++){ for( i = 0; i <= Max; i++){ for( j = 0; j <= x[k]*c[k]; j += x[k] ){ if( r[i] != 0 && i+j <= Max) { t[i+j] += r[i]; } } } for( i = 0; i <= Max; i++){ r[i] = t[i]; t[i] = 0; } } for( i = 0; i <= Max; i++){ if( r[i] == 0) { break; } } result = i;}int main(){ while(scanf("%d%d%d",c+0,c+1,c+2), c[0] || c[1] || c[2]){ Max = 0; Max = x[0] * c[0] + x[1] * c[1] + x[2] * c[2]; init(); printf("%d\n",result); } return 0;}
- hdu 1085(普通型母函数)
- hdu 1028(普通型母函数)
- hdu 1398(普通型母函数)
- hdu 1171(普通型母函数)
- hdu 1709(普通型母函数)
- 普通型母函数模板
- [ACM] hdu 2079 选课时间(普通型母函数)
- hdu 2082--找单词 普通型母函数的应用
- 2017-10-22 HDU 2082 普通型母函数
- 普通型母函数模板理解
- 母函数——普通型母函数
- B.找单词——(HDU 2082 普通型母函数)
- 普通型母函数详解及其模板类型
- HDOJ1028(正整数拆分-普通型母函数模板)
- hdu1284钱币兑换问题 (普通型母函数)
- 普通型母函数原理及模板代码详解
- 生成函数入门-普通型生成函数
- 普通型母函数学习小记 Hdu1028 + Hdu1085 Holding Bin-Laden Captive! +Hdu2082
- Android学习四、Android中的Adapter
- python 规范
- 数学之美系列二:谈谈中文分词
- Android的NDK开发(5)————Android JNI层实现文件的read、write与seek操作
- Python:pygame游戏编程之旅七(pygame基础知识讲解1)
- hdu 1085(普通型母函数)
- libevent库源码学习-kqueue( freebsd)
- Project Server与Exchange任务协同(故障排错补充)
- iphone开发之线程的使用详解
- 数学之美系列三:隐含马尔可夫模型在语言处理中的应用
- 数学之美系列四:怎样度量信息?
- 由简到难生成数据库报表(一)
- 数学之美系列五:布尔代数和搜索引擎的索引
- C# 弹钢琴程序