思路:由于n只有1000,所以n方爆就好了
#include<bits\stdc++.h>
using namespace std;
struct Node
{
int x,y;
}nodes[1005];
int vis[1005];
int main()
{
int n,x0,y0;
scanf("%d%d%d",&n,&x0,&y0);
for(int i = 1;i<=n;i++)
{
scanf("%d%d",&nodes[i].x,&nodes[i].y);
nodes[i].x-=x0;
nodes[i].y-=y0;
}
int ans = 0;
for(int i = 1;i<=n;i++)
{
if(!vis[i])
{
vis[i]=1;
ans++;
for(int j = 1;j<=n;j++)
if(!vis[j] && nodes[i].x*nodes[j].y==nodes[i].y*nodes[j].x)
vis[j]=1;
}
}
printf("%d\n",ans);
}