母函数之 Holding Bin-Laden Captive! hdoj 1085
来源:互联网 发布:sql常用查询语句 编辑:程序博客网 时间:2024/06/06 05:00
Holding Bin-Laden Captive!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14834 Accepted Submission(s): 6641
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
方法1:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define M 10000
int c1[M];
int c2[M];
int coin[4]={0,1,2,5};
int num[4];
int main()
{
while(scanf("%d%d%d",&num[1],&num[2],&num[3]),(num[1]+num[2]+num[3]))
{
int i,j,k,money;
for(i=money=1;i<4;i++)
money+=num[i]*coin[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<4;i++)
{
for(j=0;j<=money;j++)
for(k=0;k<=num[i];k++)
c2[j+k*coin[i]]+=c1[j];
for(j=0;j<=money;j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
for(i=1;i<money+2;i++)
if(c1[i]==0)
{
printf("%d\n",i);
break;
}
}
return 0;
}
#include<string.h>
#include<stdlib.h>
#define M 10000
int c1[M];
int c2[M];
int coin[4]={0,1,2,5};
int num[4];
int main()
{
while(scanf("%d%d%d",&num[1],&num[2],&num[3]),(num[1]+num[2]+num[3]))
{
int i,j,k,money;
for(i=money=1;i<4;i++)
money+=num[i]*coin[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<4;i++)
{
for(j=0;j<=money;j++)
for(k=0;k<=num[i];k++)
c2[j+k*coin[i]]+=c1[j];
for(j=0;j<=money;j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
for(i=1;i<money+2;i++)
if(c1[i]==0)
{
printf("%d\n",i);
break;
}
}
return 0;
}
方法二:
#include <stdio.h>
#include <math.h>
#include<stdlib.h>
int main()
{
int num1=0,num2=0,num5=0;
while(scanf("%d%d%d",&num1,&num2,&num5),(num1+num2+num5))
{
int ret=0;
if(num1==0)
ret = 1;
else
{
ret = num1+2*num2+1;
if(ret-1>=4)
ret=ret+num5*5;
}
printf("%d\n",ret);
}
return 0;
}
#include <math.h>
#include<stdlib.h>
int main()
{
int num1=0,num2=0,num5=0;
while(scanf("%d%d%d",&num1,&num2,&num5),(num1+num2+num5))
{
int ret=0;
if(num1==0)
ret = 1;
else
{
ret = num1+2*num2+1;
if(ret-1>=4)
ret=ret+num5*5;
}
printf("%d\n",ret);
}
return 0;
}
0 0
- 母函数之 Holding Bin-Laden Captive! hdoj 1085
- HDOJ/HDU 1085 母函数 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!(母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive! (母函数)
- HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
- 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 (母函数)
- HDOJ 1085 Holding Bin-Laden Captive
- hdu/hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- hdoj 1085 Holding Bin-Laden Captive!
- HDOJ 1085 Holding Bin-Laden Captive!
- MySQL索引详细介绍
- ZOJ1149
- hdu-oj 1412 {A} + {B}
- MapReduce 计数器简介
- 性能调优基础篇之内存中大量重复String对象
- 母函数之 Holding Bin-Laden Captive! hdoj 1085
- MySQL视图
- 常见的集成声卡芯片
- Cocos2d-x使用中遇到的问题
- hdu 1698 Just a Hook(线段树的区间更新及求和)
- AIDL
- 云服务器-产品介绍
- Vision引擎中环境地形技术信息
- MySQL内置函数详细介绍