神奇的母函数(三) hdoj 1085 Holding Bin-Laden Captive!【母函数】
来源:互联网 发布:ae mac 中文破解版 编辑:程序博客网 时间:2024/06/05 16:16
感谢TankyWoo大大的详细解说,易懂,全面,详细!!!链接http://www.cppblog.com/MiYu/archive/2010/08/05/122290.html
粘一下题目和代码表示水过~~~ (这道是取有限个但不局限于1个)
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14529 Accepted Submission(s): 6507
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>#include<string.h>int c1[10005], c2[10005];int main(){int num1, num2, num5, ans, i, j, k;while(scanf("%d%d%d", &num1, &num2, &num5), num1||num2||num5){memset(c1, 0, sizeof(c1) );memset(c2, 0, sizeof(c2) );for(i = 0; i <= num1; i ++)c1[i] = 1;for(i = 0; i <=num1; i ++)for(j = 0; j <=num2*2;j+=2)c2[i+j] = c1[i];for(i = 0; i <= num1+num2*2; i++){c1[i] = c2[i];c2[i] = 0;}for(i = 0; i <=num1+num2*2; i++)for(j = 0; j <=num5*5; j+=5)c2[i+j] = c1[i];for(i = 0; i <= 10003; i ++)if(c2[i] == 0){printf("%d\n", i);break;}}}
0 0
- 神奇的母函数(三) 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!
- 母函数之 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!(母函数)
- 二叉树
- 浅尝百度地图LBS开发
- Android 判断用户2G/3G/4G移动数据网络
- 机房收费系统exe的安装
- STM32学习笔记-串口
- 神奇的母函数(三) hdoj 1085 Holding Bin-Laden Captive!【母函数】
- vnc配置实用
- 编码最佳实践(1)--小心"数据溢出"
- Longest Substring Without Repeating Characters
- Netty4 -- ChannelPipeline
- 归并排序递归
- 关于android 如何安装 assets文件下的apk
- 学习php需要了解的点1
- 多普勒失真信号重采样的Matlab仿真分析