UVA10167-Birthday Cake

题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=107&page=show_problem&problem=1108

 

package D0810;
import java.util.*;
/*
 * 题目大意：有一个蛋糕，上面有2N个樱桃，切一刀，使得每块蛋糕有n个樱桃
 * 思路：蛋糕的半径为100，所以只要枚举-100到100的点就可以了---直接暴力枚举
 * */
public class UVA10167 {
	static class Cherry{
		int x,y;
	}
	static int n;
	static Cherry[]cherries;
	public static void main(String[] args) {
		Scanner sc = new Scanner (System.in);
		while(sc.hasNext()){
			n = sc.nextInt();
			if(n==0)break;
			cherries = new Cherry[2*n];
			int num = 0;
			for (int i = 0; i < 2 * n; i++) {
				int x = sc.nextInt();
				int y = sc.nextInt();
				if (x <= 100 && x >= -100 && y <= 100 && y >= -100) {
					cherries[num] = new Cherry();
					cherries[num].x = x;
					cherries[num++].y = y;
				}
			}
			sove(num);
		}
	}
	public static void sove(int num){
		int u,d,l;
		for(int a = -100;a<=100;a++){
			for(int b = -100;b <=100 ;b++){
				u = d = 0;
				for(int i = 0;i<num;i++){
					l = cherries[i].x*a+cherries[i].y*b;
					if(l>0)u++;
					else if(l<0)d++;
					else break;//等于0，说明有樱桃被切成了两半，不符合题意
				}
				if(u==d && u==num/2){System.out.println(a+" "+b);return;}
			}
		}
	}

}