CodeForces - 514B Han Solo and Lazer Gun
来源:互联网 发布:听着记英语单词的软件 编辑:程序博客网 时间:2024/06/06 01:21
题意:
给出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.
The first line contains three integers n, x0 и 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 xi, yi ( - 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.
Print a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers.
4 0 01 12 22 0-1 -1
2
2 1 21 11 0
1
Explanation to the first and second samples from the statement, respectively:
- CodeForces 514B Han Solo and Lazer Gun
- CodeForces - 514B Han Solo and Lazer Gun
- Codeforces 514B Han Solo and Lazer Gun【思维】
- CodeForces 518B - Han Solo and Lazer Gun
- B. Han Solo and Lazer Gun
- B. Han Solo and Lazer Gun
- B. Han Solo and Lazer Gun
- Codeforces 514 B . Han Solo and Lazer Gun 精度 除0
- Han Solo and Lazer Gun
- Codeforces Round #291 (Div. 2) Han Solo and Lazer Gun
- Codeforces Round #291 (Div. 2) Han Solo and Lazer Gun
- Codeforces Round #291 (Div. 2) -- B. Han Solo and Lazer Gun (计算几何~暴力)
- Han Solo and Lazer Gun (Codeforces Round #291 (Div. 2)B)
- Codeforces Round #291 (Div. 2) B. Han Solo and Lazer Gun
- Codeforces Round #291 (Div. 2)---B. Han Solo and Lazer Gun
- CodeForces 514B - Watto and Mechanism
- codeforces B. Ciel and Duel
- codeforces B. Sereja and Contests
- 简单的java的一个demo
- 户外决策官方教学视频上线了
- Android动画
- live555 - handle_play流程图
- 想发布一篇文章
- CodeForces - 514B Han Solo and Lazer Gun
- 构建类似Office 2007框架的WPF应用程序(1)
- 设计模式笔记 简单工厂,抽象工厂,工厂
- 2014华为比赛试题二
- IE文件下载时中文文件名乱码
- Measure(0,0)的探讨
- filebeat 配置文件详解
- android_75_ContentObserver_短信内容观察者
- POJ 1003