杭电ACM hdu 1085 Holding Bin-Laden Captive! 解题报告（母函数）

最新推荐文章于 2022-01-24 16:12:32 发布

原创最新推荐文章于 2022-01-24 16:12:32 发布 · 4.4k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#杭电 #acm #算法 #母函数

ACM/ICPC 同时被 3 个专栏收录

33 篇文章

订阅专栏

ACM竞赛解题报告

30 篇文章

订阅专栏

母函数

8 篇文章

订阅专栏

本文探讨了恐怖分子本·拉登如何利用隐藏在中国杭州的一个秘密洞穴中的时间，投身于数学难题中，并设下了一个挑战。如果有人能解决他的问题，他将自首。问题涉及使用三种不同面额的中国硬币（1元、2元、5元），找出不能通过这些硬币组合支付的最小金额。通过一系列复杂的数学操作，读者可以轻易解答这一难题。

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

Author

lcy

Solution

以下部分的版权归本人（小飞）所有。所有权利保留。

欢迎转载，转载时请注明出处：

http://blog.csdn.net/xiaofei_it/article/details/17041467

本题直接套用母函数模板即可。关于母函数的详细解释请看：

http://blog.csdn.net/xiaofei_it/article/details/17042651

代码如下：

#include <iostream>
#include <cstring>
using namespace std;
int n[3],a[9000],b[9000],i,j,k,last,last2;
int v[3]={1,2,5};
int main()
{
	while ((cin>>n[0]>>n[1]>>n[2])&&(n[0]!=0||n[1]!=0|n[2]!=0))
	{
		a[0]=1;
		last=0;
		for (i=0;i<=2;i++)
		{
			last2=last+n[i]*v[i];
			memset(b,0,sizeof(int)*(last2+1));
			for (j=0;j<=n[i];j++)
				for (k=0;k<=last;k++)
					b[k+j*v[i]]+=a[k];
			memcpy(a,b,sizeof(int)*(last2+1));
			last=last2;
		}
		for (i=0;i<=last;i++)
			if (a[i]==0)
				break;
		cout<<i<<endl;
	}
	return 0;
}