HDOJ 题目1085 Holding Bin-Laden Captive! (母函数)
来源:互联网 发布:三星g925a支持的网络 编辑:程序博客网 时间:2024/06/05 16:51
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14579 Accepted Submission(s): 6525
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
ac代码
#include<stdio.h>int main(){int num1,num2,num3,c1[100000],c2[100000],max,i,j,k;//数组开小了while(scanf("%d%d%d",&num1,&num2,&num3)!=EOF,num1||num2||num3){max=num1+num2*2+num3*5;for(i=0;i<=max;i++){c1[i]=0;c2[i]=0;}//for(i=0;i<=max;i++)//c2[i]=0;for(i=0;i<=num1;i++)c1[i]=1;for(i=0;i<=num1;i++)for(j=0;j<=num2*2;j+=2)c2[j+i]+=c1[i];for(i=0;i<=num2*2+num1;i++){c1[i]=c2[i];c2[i]=0;}for(i=0;i<=num1*1+num2*2;i++)for(j=0;j<=num3*5;j+=5){c2[j+i]+=c1[i];}for(i=0;i<=num1*1+num2*2+num3*5;i++){c1[i]=c2[i];c2[i]=0;}for(i=0;i<=max;i++){if(!c1[i]){printf("%d\n",i);break;}}//printf("\n");if(i==max+1)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!(母函数)
- 变量作用域
- UDT协议深入解析
- HDU_2163 Palindromes
- 学生信息管理系统总结——细节问题
- [matlab]通道化测试程序
- HDOJ 题目1085 Holding Bin-Laden Captive! (母函数)
- 多线程(五):Volatile 关键字
- C#操作IIS程序池及站点的创建配置实现代码
- Spring MVC 教程,快速入门,深入分析
- HUST1017--Exact cover(Dancing Links)
- 用c语言的实现一个简单的交互式shell
- 我就想问问,是不是现在跟郭美美有关的都在被查啊
- Cracking coding interview(2.5) 查找环形链表的环形起点
- 在VBA中使用JAVASCRIPT和VBSCRIPT