显示代码纯文本
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int cool(int a);
int n,x[101],y[101];
struct dota
{
int x;
int y;
}we[101];
int main()
{
freopen("asm_fuel.in","r",stdin);
freopen("asm_fuel.out","w",stdout);
int i,p,ans=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d%d",&x[i],&y[i]);
for(i=1;i<=n;i++)
ans=max(ans,cool(i));
ans=max(1,ans);
printf("%d",ans);
return 0;
}
int cool(int a)
{
int i,p,t=0,l=0,w=0;
for(i=1;i<=n;i++)
{
if(i==a)
continue;
if(x[i]-x[a]==0&&y[i]-y[a]==0)
{
w++;continue;
}
we[++l].x=x[i]-x[a];
we[l].y=y[i]-y[a];
}
for(i=1;i<=l;i++)
{ int q=2;
for(p=1;p<=l;p++)
{
if(i==p)
continue;
if(we[i].x*we[p].y==we[i].y*we[p].x)
q++;
}
t=max(t,q+w);
}
return t;
}