HDU 1709 母函数

最新推荐文章于 2019-02-10 22:34:36 发布

liang_all

最新推荐文章于 2019-02-10 22:34:36 发布

阅读量402

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/u011566113/article/details/9747121

版权

数论专栏收录该内容

16 篇文章 0 订阅

订阅专栏

The Balance

Problem Description

Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot be measured from the range [1,S]. S is the total quality of all the weights.

Input

The input consists of multiple test cases, and each case begins with a single positive integer N (1<=N<=100) on a line by itself indicating the number of weights you have. Followed by N integers Ai (1<=i<=N), indicating the quality of each weight where 1<=Ai<=100.

Output

For each input set, you should first print a line specifying the number of qualities which cannot be measured. Then print another line which consists all the irrealizable qualities if the number is not zero.

Sample Input

Sample Output

题意：

给出n个物品及其重量，求1-sum(sum为着多个物品的总重量)

然后进行称量,看不能称出的价值有几个

其中不能称出的价值包括：直接称出的和间接称出.以外的

母函数模板变形一下,,

数组要开大。切记

#include <iostream>
#include <cmath>
using namespace std;
int a[111];
int sum,n;
int cnt;
int c1[11111],c2[11111];
int main()
{
	int i,j,k;
	while(~scanf("%d",&n))
	{
		sum=cnt=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			sum+=a[i];
		}
		memset(c1,0,sizeof(c1));
		memset(c2,0,sizeof(c2));
		c1[0]=1,c1[a[1]]=1;//第一个遍历
		int m=a[1];
		for(i=2;i<=n;i++)//第二个式子开始，2-n
		{
			for(j=0;j<=m;j++)//第j-th个式子
			{
				for(k=0;k<=a[i];k+=a[i])
				{
					c2[k+j]+=c1[j];//天平可加可减
					c2[abs(k-j)]+=c1[j];//减
				}
			}
			m+=a[i];
			for(j=0;j<=m;j++)
				c1[j]=c2[j],c2[j]=0;
		}
		for(i=1;i<=sum;i++)
			if(c1[i]==0)
				cnt++;//计算有几个不能称量
		printf("%d\n",cnt);
		if(cnt)//没有则不用输出
		{
			for(i=0;i<=sum;i++)
			{
				if(c1[i]==0)
				{
					printf("%d",i);
					if(cnt>1)printf(" ");
					else printf("\n");
					cnt--;
				}
			}
		}
	}
	return 0;
}