3129799_ce.cc

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>

double INF = 210000000000;

using namespace std;

double x[701], y[701];

int main()
{
	int i, j, n, l, max, ans;
	double K[701];

	while(scanf("%d",&n),n)
	{
		for(i = 0; i < n; i++)
		{
			scanf("%lf%lf",&x[i],&y[i]);
		}
		ans = 0;
		for(i = 0; i < n; i++)
		{
			int k = 0, t = 0;
			for(j = 0; j < n; j++)
			{
				if(x[i]==x[j]&&y[i]==y[j])	
				{
					t++;
					continue;
				}
				if(x[j]!=x[i])
				{
					K[k++] = (y[j]-y[i])/(x[j]-x[i]);
				}
				else	
				{
					K[k++]=INF;
				}
			}	
			sort(K,K+k);
			max = t;
			for(j = 0; j < k; j++)
			{
				l = j;
				int cnt = t;
				while(l < k&&K[l]==K[j])
				{
					cnt++;
					l++;
				}
				if(cnt > max)
				{
					max = cnt;
				}
				j = l-1;
			}
			if(max > ans)
			{
				ans = max;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}