Codeforces 514 B . Han Solo and Lazer Gun 精度 除0
来源:互联网 发布:朝鲜有多穷 知乎 编辑:程序博客网 时间:2024/06/05 12:03
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
题目分析。。。eps别忘记了。。还有除0的特殊判断。。脑残了半天,除0没有判断出来
代码:
#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x0f0f0f0f#define eps 1e-10using namespace std;struct Point{double x;double y;};int main(){int i,j,k,l,m,n,sum=1,flag=0;double x,y;double tana[1005];Point point[1005];scanf("%d%lf%lf",&n,&x,&y);for(i=0;i<n;i++){scanf("%lf%lf",&point[i].x,&point[i].y);}for(i=0;i<n;i++){if(fabs(point[i].x-x)>eps)tana[i]=(point[i].y-y)*1.0/(point[i].x-x);else{tana[i]=1000000000000;}}sort(tana,tana+n);for(i=1;i<n;i++){//printf("%.2lf ",tana[i]);if(tana[i]-tana[i-1]>eps)sum++;}printf("%d\n",sum);}
- Codeforces 514 B . Han Solo and Lazer Gun 精度 除0
- 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
- 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 Round 272 (Div 2)C】【暴力】Dreamoon and Sums 所有除b结果是模b结果[1,a]倍数字之和
- codeforces B. Ciel and Duel
- 扫雷游戏 C语言实现
- Java学习笔记9
- 出现次数最多的整数
- POJ 3067 Japan
- test
- Codeforces 514 B . Han Solo and Lazer Gun 精度 除0
- 华容道自动求解 java版
- 【翻译自mos文章】解释 datafile name中的MISSING关键字
- 【OpenCV_C++】学习杂记
- 指数型母函数
- Oracle 11g安装指南
- 利用SPI编写类似sockscap的代理工具
- HDU 3068 最长回文(初遇manacher)
- POJ 1258 Agri-Net