1292 - Laser Shot

//这些运算符重载看起来有点乱
//核心思想是极角排序 
#include <bits/stdc++.h>
using namespace std;
struct point{
	int x, y;
	friend bool operator <(const point& p1,const point& p2);
	friend bool operator ==(const point& p1, const point& p2);
	friend bool operator >(const point& p1, const point& p2){
		if(p1.y == p2.y) return p1.x > p2.x;
		return p1.y > p2.y;
	}
};
point pb, p[800], pm, pt;

bool operator <(const point& p1, const point& p2){
	return (p1.x-pb.x)*(p2.y-pb.y) - (p2.x-pb.x)*(p1.y-pb.y) < 0;
}
bool operator ==(const point& p1, const point& p2){
	return (p1.x-pb.x)*(p2.y-pb.y) - (p2.x-pb.x)*(p1.y-pb.y) == 0;
}
	
int main()
{
	int t, cas = 1, i, j, k, m, n, maxn;
	cin >> t;
	while(t--)
	{
		maxn = 1;
		scanf("%d",&n);
		for(i = 1; i <= n; i++)
		scanf("%d%d",&p[i].x, &p[i].y);
		if(n == 1){
			printf("Case %d: 1\n",cas++);
			continue;
		}
		for(i = 1; i <= n; i++)
		{
			pb = p[i], k = i;
			for(j = i; j <= n; j++) if(pb > p[j]) pb = p[j], k = j;
			pt = p[k], p[k] = p[i], p[i] = pt;
			sort(p+i+1, p+n+1);
			k = 1;
			for(j = i+1; j <= n; j++)
			{
				if(j < n && p[j] == p[j+1])k++;
				else 
					maxn = max(maxn, k), k = 1;
			}
		}
		printf("Case %d: %d\n",cas++, maxn+1);
	}
	return 0;
}