hdu 1085 母函数

 

Holding Bin-Laden Captive!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5415    Accepted Submission(s): 2364

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!

 

 

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
  
  
  
  

  
  

  
  

   
   一开始看到这题，就直接用暴力来解决，结果921ms，差点超时了，我就觉得不太好，应该有好更好的方法，结果百度一下知道这题用母函数
  
  
  
  

   
   做起来要快很多，经过一番剪枝46ms过了，
  
  
  
  

   
   暴力法代码：
  
  
  
  

   
   #include<iostream>
using namespace std;
int main()
{
	int ma[8002];
	int i,j,k,a,b,c;

	while(scanf("%d%d%d",&a,&b,&c),a+b+c)
	{
		memset(ma,0,sizeof(ma));
		for(i=0;i<=a;i++)
		{
			for(j=0;j<=b;j++)
			{
				for(k=0;k<=c;k++)
				{
					ma[i+j*2+k*5]=1;
				}
			}
		}
		for(i=1;i<=a+b*2+c*5+1;i++)
		{
			if(ma[i]==0)
			{
				printf("%d/n",i);
				break;
			}
		}
	}
	return 0;
}
 

  
  
  
  

   
   母函数代码：
  
  
  
  

   
   #include<iostream>
using namespace std;
int main()
{
	int c1[8002],c2[8002];
    int i,k,j,c[3],sum,a[3]={1,2,5};

	while(scanf("%d%d%d",&c[0],&c[1],&c[2]),c[0]+c[1]+c[2])
	{
		sum=c[0]+c[1]*2+c[2]*5;
		memset(c1,0,sizeof(c1));
		memset(c2,0,sizeof(c2));
		for(i=0;i<=c[0];i++)
			c1[i]=1;

		for(i=1;i<3;i++)
		{
			for(j=0;j<=sum;j++)
			{
				if(c1[j])//如果c1[j]==0,即j此时无法所给的硬币用硬币表示，那么j+k（k>0）
					     //此时也不能用已知硬币表示
				{
					for(k=0;k+j<=sum&&k<=c[i]*a[i];k+=a[i])
					{
						c2[k+j]=c1[j];
					}
				}
			}
			for(j=0;j<=sum;j++)
			{
				c1[j]=c2[j];
				c2[j]=0;
			}
		}
		for(i=1;i<=sum+1;i++)
		{
			if(c1[i]==0)
			{
				printf("%d/n",i);
				break;
			}
		}
	}
	return 0;
}