hdu 1085 Holding Bin-Laden Captive! 母函数的基本运用,,还是不难的
来源:互联网 发布:淘宝dw去除热点边框 编辑:程序博客网 时间:2024/06/16 08:54
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16063 Accepted Submission(s): 7206
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
如果你刚学母函数的话,那这道题可能会是你的一道坎,,不要怕,最好别看别人的代码和题解,,若这题自己想通了,我想对母函数的理解,会到下一个层次的,加油吧
代码:
#include <stdio.h>#define MAX 10100int main(){int c1[MAX] , c2[MAX] ,num[5] , a[]={0,1,2,5}; while(~scanf("%d%d%d",&num[1],&num[2],&num[3]) &&(num[1]||num[2]||num[3])){int m = num[1]*a[1]+num[2]*a[2]+num[3]*a[3] ;for(int i = 0 ; i <= m ; ++i){c1[i] = 1 ;c2[i] = 0 ;}c1[m+1] = 0 ;int len = num[1]*a[1] ;for(int i = 2 ; i <= 3 ; ++i){len += num[i]*a[i] ;for(int j = 0 ; j <= len-num[i]*a[i] ; j++){for(int k = 0 ; k+j <= len; k+=a[i]){c2[j+k] += c1[j] ;}}for(int j = 0 ; j <= len ; ++j){c1[j] = c2[j] ;c2[j] = 0 ;}}for(int i = 0 ; i < MAX ; ++i){if(c1[i] == 0){printf("%d\n",i);break ;}}}return 0 ;}
与君共勉
0 0
- hdu 1085 Holding Bin-Laden Captive! 母函数的基本运用,,还是不难的
- HDU 1085-Holding Bin-Laden Captive!(简单的母函数)
- HDOJ/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!(母函数)
- hdu 1085 Holding Bin-Laden Captive! (母函数)
- HDU 1085 Holding Bin-Laden Captive! 母函数
- HDU 1085-Holding Bin-Laden Captive!(母函数)
- Linux内存管理(2) - buddy系统
- hiho 挑战赛7(有钱就是任性-dp与质数的因子)
- POJ - 3299 Humidex
- 前端强化系统与服务器交互
- ios小知识
- hdu 1085 Holding Bin-Laden Captive! 母函数的基本运用,,还是不难的
- Dashboard-view自定义jenkins任务集视图
- 二叉树的存储结构
- 网络流
- 博客初笔
- lightOJ 1047 Neighbor House (DP)
- Think in Java(十一):类型信息
- 一道提交过很多次才过的水题= = 回文数字
- Python实例浅谈之六读写文件