hdu1085——Holding Bin-Laden Captive!
来源:互联网 发布:中国金融数据网 编辑:程序博客网 时间:2024/06/05 18:00
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19031 Accepted Submission(s): 8466
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<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int num[4]; while(cin>>num[1]>>num[2]>>num[3],num[1]||num[2]||num[3]) { int price[4]={0,1,2,5}; int n=0,m,i,j,k,c1[100100],c2[100100]={0}; for(i=1;i<=3;i++) n+=num[i]*price[i]; memset(c1,0,sizeof(c1)); memset(c2,0,sizeof(c2)); for(i=0;i<=num[1];i++) c1[i]=1; for(i=2;i<=3;i++) { for(j=0;j<=n;j++) for(k=0;k+j<=n&&k/price[i]<=num[i];k+=price[i]) c2[j+k]+=c1[j]; for(m=0;m<=n;m++) { c1[m]=c2[m]; c2[m]=0; } } bool bo=0; for(i=0;i<=n;i++) { if(c1[i]==0) { printf("%d\n",i); bo=1; break; } } if(bo==0) cout<<n+1<<endl; } return 0;}我只想做一个努力的人!加油!
0 0
- hdu1085——Holding Bin-Laden Captive!
- Holding Bin-Laden Captive!(hdu1085)——母函数
- hdu1085-Holding Bin-Laden Captive!
- hdu1085 Holding Bin-Laden Captive!
- hdu1085 Holding Bin-Laden Captive!
- HDU1085 Holding Bin-Laden Captive!
- HDU1085 Holding Bin-Laden Captive!
- hdu1085(Holding Bin-Laden Captive!)
- hdu1085 Holding Bin-Laden Captive!
- HDU1085 Holding Bin-Laden Captive!,母函数
- HDU1085 Holding Bin-Laden Captive! 【母函数】
- 【HDU1085】Holding Bin-Laden Captive! 母函数
- HDU1085 Holding Bin-Laden Captive!(母函数)
- hdu1085 Holding Bin-Laden Captive! (多重背包)
- HDU1085 Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!
- Holding Bin-Laden Captive!
- Holding Bin-Laden Captive!
- hdu 2088 简易版之最短距离
- Bravo!Java学习笔记(2)---泛型程序设计
- C# 基础加强(三) 虚方法:virtual
- POJ 3069
- Deep Learning 学习笔记一
- hdu1085——Holding Bin-Laden Captive!
- vim常用命令和操作技巧
- poj2594Treasure Exploration
- Treap(树堆)
- 刷题、OJ-1033 求Sn=a+aa+aaa+…+aa…aaa(有n个a)之值
- Codeforces AIM Tech Round (Div. 2) 624A A. Save Luke
- Android使用序列化接口Parcelable、Serializable
- 泛型_文件流
- 百思学习笔记11-关注模块