ZOJ-3706

最新推荐文章于 2020-10-08 22:15:10 发布

心之痕

最新推荐文章于 2020-10-08 22:15:10 发布

阅读量396

点赞数

分类专栏：水题 ZOJ 文章标签： ZOJ

本文链接：https://blog.csdn.net/xhldtc/article/details/38736251

版权

ZOJ 同时被 2 个专栏收录

546 篇文章 3 订阅

订阅专栏

水题

43 篇文章 0 订阅

订阅专栏

水题一道，求组合数最多的拆分，直接枚举就行了

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

namespace
{
	int mass[3][3];
	bool flag[201];

	int solve(int a, int b, int c)
	{
		memset(flag, 0, sizeof(flag));
		memset(mass, 0, sizeof(mass));
		mass[0][1] = a;
		mass[0][2] = -a;
		mass[1][1] = b;
		mass[1][2] = -b;
		mass[2][1] = c;
		mass[2][2] = -c;

		int res = 0;
		for (int i = 1; i < 27; i++)
		{
			int sum = abs(mass[0][i / 9] + mass[1][i / 3 % 3] + mass[2][i % 3]);
			if (sum && !flag[sum])
			{
				flag[sum] = true;
				res++;
			}
		}
		return res;
	}
}

int main()
{
	int T, x, y;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d %d", &x, &y);
		int maxx = 0;
		for (int i = 1; i <= x / 2; i++)
			maxx = max(solve(i, x - i, y), maxx);
		for (int j = 1; j <= y / 2; j++)
			maxx = max(solve(j, y - j, x), maxx);
		printf("%d\n", maxx);
	}
	return 0;
}