与poj2606相同的题
#include<stdio.h>
struct node
{
int x;
int y;
}point[1001];
int main()
{
int n,i,j,k,max,p;
while(scanf("%d",&n)!=EOF)
{
max=0;
for(i=0;i<n;i++)
scanf("%d%d",&point[i].x,&point[i].y);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
p=0;
for(k=j+1;k<n;k++)
{
if((point[i].x-point[j].x)*(point[i].y-point[k].y)==(point[i].x-point[k].x)*(point[i].y-point[j].y))
p++;
}
if(p>max)
max=p;
}
printf("%d\n",max+2);
}
return 0;
}