落絮飞雁的个人网站
HDOJ1085:Holding Bin-Laden Captive!——母函数
HDOJ1085:Holding Bin-Laden Captive!——母函数

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! ”

http://acm.hdu.edu.cn/data/images/1085_1.jpg

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 3
0 0 0

Sample Output
4

 

参考代码:

#include
#include
#include
int c1[1000],c2[10000];
int main()
{
	int n1,n2,n5;
	while(scanf("%d%d%d",&n1,&n2,&n5)==3,n1+n2+n5)
	{
		int n,i,j,k;
		n=n1+n2*2+n5*5;
		for(i=0;i<=n;i++)//init c1 c2
		{
			c1[i]=0;c2[i]=0;
		}
		for(i=0;i<=n1;i++)//只有 1
		{
			c1[i]=1;
		}
		for(i=0;i<=n1;i++)//存在1和2
		{
			for(j=0;j<=n2*2;j+=2)
			{
				c2[i+j]+=c1[i];
			}
		}
		for(k=0;k<=n1+n2*2;k++)
		{
			c1[k]=c2[k];c2[k]=0;
		}
		for(j=0;j<=n1+n2*2;j++)//存在1、2、5
		{
			for(k=0;k<=n5*5;k+=5)
			{
				c2[k+j]+=c1[j];
			}
		}
		for(i=0;i<=5*n5+2*n2+n1;i++)
		{
			c1[i]=c2[i];c2[i]=0;
		}
		bool flag=0;
		for(i=0;i<=n;i++)
		{
			if(c1[i]==0)
			{
				printf("%d\n",i);
				flag=1;
				break;
			}
		}
			if(!flag)
				printf("%d\n",n+1);
		}
		return 0;
	}

 

原文标题:HDOJ1085:Holding Bin-Laden Captive!——母函数|落絮飞雁的个人网站
授权协议:创作共用 署名-非商业性使用 2.5 中国大陆
除注明外,本站文章均为原创;转载时请保留上述链接。
没有标签
首页      ACM      HDOJ      HDOJ1085:Holding Bin-Laden Captive!——母函数

发表评论

textsms
account_circle
email

落絮飞雁的个人网站

HDOJ1085:Holding Bin-Laden Captive!——母函数
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 C…
扫描二维码继续阅读
2016-02-29