HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
来源:互联网 发布:linux 查看hba 编辑:程序博客网 时间:2024/06/05 02:44
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14769 Accepted Submission(s): 6617
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
Recommend
We have carefully selected several similar problems for you: 1171 1709 2069 1059 1081
额,,换了种母函数的写法再做这题也a了
收藏一下
ac代码
#include<stdio.h>#include<string.h>int c1[100010],c2[100010];int main(){int a[5],b[5];b[0]=1;b[1]=2;b[2]=5;while(scanf("%d%d%d",&a[0],&a[1],&a[2])!=EOF,a[0]||a[1]||a[2]){int max,i,j,k,c=0;max=a[0]+2*a[1]+5*a[2];memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));for(i=0;i<=a[0];i++)c1[i]=1;for(i=1;i<=2;i++){for(j=0;j<=max;j++){for(k=0;k*b[i]+j<=max&&k<=a[i];k++){c2[k*b[i]+j]+=c1[j];}}for(j=0;j<=max;j++){c1[j]=c2[j];c2[j]=0;}}for(i=0;i<=max;i++){if(!c1[i])break;}printf("%d\n",i);}}
0 0
- 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!
- 母函数之 Holding Bin-Laden Captive! hdoj 1085
- Holding Bin-Laden Captive! 【HDOJ-1085-母函数】
- HDOJ Holding Bin-Laden Captive! 1085【母函数】
- 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--1085Holding Bin-Laden Captive!!!母函数
- Holding Bin-Laden Captive! 1085 (母函数)
- Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!(母函数)
- Holding Bin-Laden Captive!(母函数)
- LCA离线+在线+hdu2586(模板)
- 在oracle的聚合函数(sum、avg等)中使用group by来分组你的结果
- Runtime(二)
- LeetCode——Distinct Subsequences
- c++ const 指针 简单解释
- HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
- hdu-oj 1157 Who's in the Middle
- 第一个项目(第5600小时加入)
- 洁面皂
- 仿淘点点 demo
- db数据库利用第三方框架进行提取和解析数据
- dubbo小教程
- 狗狗40题~ (Volume B)
- 关于Windows内存结构