母函数练习2 HDU 1085
来源:互联网 发布:淘宝猎狐者户外冲锋衣 编辑:程序博客网 时间:2024/05/01 09:58
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 num1,num2,num3,arr[10001],tmp[10001];int main(){freopen("in.txt","r",stdin);while(true){scanf("%d %d %d", &num1, &num2, &num3);if(num1 == 0 && num2 == 0 && num3 == 0)break;//int l = num1 + num2 * 2 + num3 * 5;int i,j;memset(arr,0,sizeof(arr));memset(tmp,0,sizeof(tmp));for(i=0; i<=num1; i++){arr[i] = 1;tmp[i] = 0;}//int m = max(num1, num2 * 2 + num1);int m = num2 * 2 + num1;//printf("%d\n",m);for(i=0; i<=m; i++){for(j=0; j+i <= m; j += 2){tmp[j+i] += arr[i];}}for(i=0; i<=m; i++){arr[i] = tmp[i];tmp[i] = 0;}m += 5*num3;for(i=0; i<=m; i++){for(j=0; j+i <= m; j += 5){tmp[j+i] += arr[i];}}for(i=1; i<=m; i++){if(tmp[i] == 0)break;}printf("%d\n",i);}return 0;}
- 母函数练习2 HDU 1085
- HDU 2082 母函数练习
- 母函数练习2
- hdu 1085 母函数
- HDU--1085 (母函数)
- hdu 1085 母函数
- HDU 1085 母函数
- HDU 1085 母函数
- hdu 1085 母函数
- hdu 1085 母函数
- 母函数练习
- 函数练习2
- HDU 1085 1028 母函数
- hdu 1085(普通型母函数)
- HDU 1085 (母函数)
- HDU 1085 母函数/思维
- HDU 1085 简单母函数
- HDU 1085 (母函数)
- 算法题: 求一个整数数组中,通过元素加减运算得到指定结果的所有运算过程. 例如【5,4,6,7,1】= 9 ?
- bug之谈
- 图:比赛打分展示双屏管理软件系统的V2.0版本终于收工.
- Log4Net使用详解(2)
- c++关于calloc、memcpy、strncpy的陷阱
- 母函数练习2 HDU 1085
- Winform Log4Net实战:实现每天一个文件记录服务程序的执行情况。
- 感知计算:开发人员的十大资源
- rss TIOBE Programming Community Index for June 2013
- cocos2d-x的初步学习十七之坦克大战四
- 维斯(Vizrt)系统学习资源列表(持续更新)
- Python 字符串操作(string替换、删除、截取、复制、连接、比较、查找、包含、大小写转换、分割等)
- 配置FCKeditor_2.6.3+fckeditor-java-2.4
- nyoj499 + 迷宫 + dfs