CodeForces - 514B Han Solo and Lazer Gun

题意:

        给出N个点,和起始点X0,Y0,求N个点中有几组不同斜率与原点连接后斜率不同的点

思路:

        考虑到可能出现的精度丢失,使用的分数的形式表示每个斜率,再用map去重就可以了

代码:

#include <iostream>
#include <map>
using namespace std;

int n,w,z,x0,y0;

int gcd(int x,int y){
    if(y) return gcd(y,x%y);
    return x;
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>n){
        cin>>x0>>y0;
        map <pair<int,int>,int > mp;
        int ans=0;
        while(n--){
            cin>>w>>z;
            w-=x0;z-=y0;
            int temp=gcd(w,z);
            w/=temp;z/=temp;
            if(!mp[make_pair(w,z)]++)
                ans++;
        }
        cout<<ans<<endl;
    }
}

There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates(x, y) on this plane.

Han Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x0, y0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x0, y0).

Your task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.

The gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location.

Input

The first line contains three integers nx0 и y0 (1 ≤ n ≤ 1000 - 104 ≤ x0, y0 ≤ 104) — the number of stormtroopers on the battle field and the coordinates of your gun.

Next n lines contain two integers each xiyi ( - 104 ≤ xi, yi ≤ 104) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.

Output

Print a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers.

Example
Input
4 0 0
1 1
2 2
2 0
-1 -1
Output
2
Input
2 1 2
1 1
1 0
Output
1
Note

Explanation to the first and second samples from the statement, respectively:


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值