UVA 10167 Birthday Cake

切蛋糕，平分上面的樱桃，数据小，直接暴力即可。

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
struct abc
{
	int x, y;
};
int n, i, j, k, n1, n2;
abc z[100];

int main(){
	while (scanf("%d", &n) != EOF&&n)
	{
		for (i = 1; i <= 2 * n; i++) cin >> z[i].x >> z[i].y;
		for (i = -500; i <= 500; i++)
			for (j = -500; j <= 500; j++)
			{
				for (n1 = 0, n2 = 0, k = 1; k <= 2 * n; k++)
				{
					if (i*z[k].x + j*z[k].y > 0) n1++;
					if (i*z[k].x + j*z[k].y < 0) n2++;
					if (i*z[k].x + j*z[k].y == 0) break;
					if (n1 > n || n2 > n) break;
				}
				if (n1 == n2&&n1 == n) goto end;
			}
		end:printf("%d %d\n", i, j);
	}
	return 0;
}

偶尔用用goto也不错。