pku1060.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#define size 2010
int f[size], g[size], h[size], ans[size];
int lf, lg, lh;
void Solve()
{
	int i, j;
	
	memset(f, 0, sizeof(f));
	memset(g, 0, sizeof(g));
	memset(h, 0, sizeof(h));
	memset(ans, 0, sizeof(ans));

	scanf("%d", &lf);
	for (i = lf - 1; i >= 0; i--)
	{
		scanf("%d", &f[i]);
	}
	
	scanf("%d", &lg);
	for (i = lg - 1; i >= 0; i--)
	{
		scanf("%d", &g[i]);
	}

	scanf("%d", &lh);
	for (i = lh - 1; i >= 0; i--)
	{
		scanf("%d", &h[i]);
	}

	for (i = 0; i < lf; i++)
	{
		if (f[i] == 0)
		{
			continue;
		}
		for (j = 0; j < lg; j++)
		{
			ans[i + j] += g[j];
			ans[i + j] %= 2;
		}
	}
	
	for (i = lf + lg - 1; i >= lh - 1; i--)
	{
		if (ans[i] == 0)
		{
			continue;
		}
		for (j = 0; j < lh; j++)
		{
			ans[i - j] += h[lh - 1 - j];
			ans[i - j] %= 2;
		}
	}
	i = lf + lg;
	while (ans[i] == 0 && i > 0)
	{
		i--;
	}
	printf("%d ", i + 1);
	i++;
	while (i--)
	{
		printf("%d ", ans[i]);
	}
	printf("\n");
}

int main()
{
	int T;
	scanf("%d", &T);
	while (T--)
	{
		Solve();
	}
	return 0;
}