洛谷P2036 [COCI2008-2009#2] PERKET进阶解法

#include<iostream>
#include<array>
#include<cmath>

using namespace std;
array<int, 1025>season;
array<int, 11>s;
array<int, 11>b;
int n;

int main()
{
	season.fill(-1);
	s[10] = 1;
	int a1, a2, a3, a4, a5, a, ans;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s[i] >> b[i];
		s[10] *= s[i];
		b[10] += b[i];
	}
	for (a = 0, a1 = 0; a1 < n; a1++, a++)
	{
		season[a] = abs(s[a1] - b[a1]);
		if (n != 1)
			season[1023 - a] = abs(s[10] / s[a1] - b[10] + b[a1]);
	}
	for (a1 = 0; a1 < n; a1++)
		for (a2 = a1 + 1; a2 < n; a2++, a++)
		{
			season[a] = abs(s[a1] * s[a2] - b[a1] - b[a2]);
			if (n != 2)
				season[1023 - a] = abs(s[10] / (s[a1] * s[a2]) - b[10] + b[a1] + b[a2]);

		}
	for (a1 = 0; a1 < n; a1++)
		for (a2 = a1 + 1; a2 < n; a2++)
			for (a3 = a2 + 1; a3 < n; a3++, a++)
			{
				season[a] = abs(s[a1] * s[a2] * s[a3] - b[a1] - b[a2] - b[a3]);
				if (n != 3)
					season[1023 - a] = abs(s[10] / s[a1] / s[a2] / s[a3] - b[10] + b[a1] + b[a2] + b[a3]);
			}
	for (a1 = 0; a1 < n; a1++)
		for (a2 = a1 + 1; a2 < n; a2++)
			for (a3 = a2 + 1; a3 < n; a3++)
				for (a4 = a3 + 1; a4 < n; a4++, a++)
				{
					season[a] = abs(s[a1] * s[a2] * s[a3] * s[a4] - b[a1] - b[a2] - b[a3] - b[a4]);
					if (n != 4)
						season[1023 - a] = abs(s[10] / s[a1] / s[a2] / s[a3] / s[a4] - b[10] + b[a1] + b[a2] + b[a3] + b[a4]);
				}
	for (a1 = 0; a1 < n; a1++)
		for (a2 = a1 + 1; a2 < n; a2++)
			for (a3 = a2 + 1; a3 < n; a3++)
				for (a4 = a3 + 1; a4 < n; a4++)
					for (a5 = a4 + 1; a5 < n; a5++, a++)
						season[a] = abs(s[a1] * s[a2] * s[a3] * s[a4] * s[a5] - b[a1] - b[a2] - b[a3] - b[a4] - b[a5]);
	ans = season[0];
	for (int i = 1; i < 1024; i++)
		if (season[i] >= 0 && season[i] < ans)
			ans = season[i];
	cout << ans;
	return 0;
}