HDOJ 1085 Holding Bin-Laden Captive!
来源:互联网 发布:java正则匹配数字 编辑:程序博客网 时间:2024/06/06 17:51
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1085
题目:
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14340 Accepted Submission(s): 6415
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
解题思路:
母函数。ps:注意一点,这里数组的上界应该是1 * a[0] + 2 * a[1] + 5 * a[2];
代码:
#include <cstdio>#include <cstring>const int MAXN = 8010;int c1[MAXN], c2[MAXN];int main(){ int a[3], c[3] = {1, 2, 5}; while(~scanf("%d%d%d", &a[0], &a[1], &a[2])) { if(0==a[0] && 0==a[1] && 0==a[2]) break; int b = a[0] + 2 * a[1] + 5 * a[2]; memset(c1, 0, sizeof(c1)); memset(c2, 0, sizeof(c2)); for(int i = 0; i <= a[0]; i++) c1[i] = 1; for(int i = 2; i <= 3; i++) { for(int j = 0; j <= b; j++) { for(int k = 0; j+k<=b && k<=a[i-1]*c[i-1]; k += c[i-1]) { c2[j+k] += c1[j]; } } for(int j = 0; j <= b; j++) { c1[j] = c2[j]; c2[j] = 0; } } for(int i = 0; ; i++) { if(0 == c1[i]) { printf("%d\n", i); break; } } } return 0;}
0 0
- HDOJ 1085 Holding Bin-Laden Captive
- hdu/hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive! <思维>
- HDOJ HDU 1085 Holding Bin-Laden Captive!
- HDOJ Holding Bin-Laden Captive!
- 1085 Holding Bin-Laden Captive!
- HDOJ/HDU 1085 母函数 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!(母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive! (母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
- 母函数之 Holding Bin-Laden Captive! hdoj 1085
- Holding Bin-Laden Captive! 【HDOJ-1085-母函数】
- HDOJ-1085-Holding Bin-Laden Captive! 解题报告
- HDOJ Holding Bin-Laden Captive! 1085【母函数】
- hdoj 1085 Holding Bin-Laden Captive!【基础母函数】
- maven的jar包查找地址
- 用google-perftool分析程序的内存/CPU使用
- extJs3.3版本中treeGrid列宽的问题
- 函数调用约定
- javascript学习总结
- HDOJ 1085 Holding Bin-Laden Captive!
- 响应式布局这件小事 设计师如何实现响应布局
- OpenERP API 接口
- notifyDataSetChanged() 动态更新ListView
- 响应式布局这件小事 设计师如何实现响应布局
- java 连接各种数据库大全
- WCF探索之旅(二)——从零开始WCF实例
- JavaScript的代码库
- Mysql数据库用户密码暴力破解