【codeforces 706A Beru-taxi】
来源:互联网 发布:北通手柄 mac设置 编辑:程序博客网 时间:2024/06/07 10:07
Beru-taxi
Beru-taxi
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi, yi) and moves with a speed vi.
Consider that each of n drivers will move directly to Vasiliy and with a maximum possible speed. Compute the minimum time when Vasiliy will get in any of Beru-taxi cars.
Input
The first line of the input contains two integers a and b ( - 100 ≤ a, b ≤ 100) — coordinates of Vasiliy’s home.
The second line contains a single integer n (1 ≤ n ≤ 1000) — the number of available Beru-taxi cars nearby.
The i-th of the following n lines contains three integers xi, yi and vi ( - 100 ≤ xi, yi ≤ 100, 1 ≤ vi ≤ 100) — the coordinates of the i-th car and its speed.
It’s allowed that several cars are located at the same point. Also, cars may be located at exactly the same point where Vasiliy lives.
Output
Print a single real value — the minimum time Vasiliy needs to get in any of the Beru-taxi cars. You answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .
Examples
input
0 0
2
2 0 1
0 2 2
output
1.00000000000000000000
input
1 3
3
3 3 2
-2 3 6
-2 7 10
output
0.50000000000000000000
Note
In the first sample, first taxi will get to Vasiliy in time 2, and second will do this in time 1, therefore 1 is the answer.
In the second sample, cars 2 and 3 will arrive simultaneously.
#include<cstdio>#include<cmath>#include<algorithm>using namespace std;int main(){ int N; double a,b,x,y,z,ans; scanf("%lf%lf",&a,&b); scanf("%d",&N); ans=999999999999.0; while(N--) { scanf("%lf%lf%lf",&x,&y,&z); ans=min(ans,sqrt((x-a)*(x-a)+(y-b)*(y-b))/z); } printf("%lf\n",ans); return 0;}
- CodeForces 706A Beru-taxi
- 【codeforces 706A Beru-taxi】
- CodeForces-706A.Beru-taxi
- codeforces 706A Beru-taxi
- codeforces 706A A. Beru-taxi
- 【模拟】Codeforces 706A Beru-taxi
- CodeForces 706A Beru-taxi 【水题】
- codeforces-367#A. Beru-taxi
- A. Beru-taxi
- 【Codeforces Round 367 (Div 2) A】【水题】Beru-taxi
- Codeforces Round #367 (Div. 2) A. Beru-taxi
- Codeforces Round #367 (Div. 2) A. Beru-taxi(很水)
- codeforces706A之Beru-taxi
- CodeForces 158B taxi
- 【codeforces】B. Taxi
- CodeForces 158B Taxi
- codeforces 158B Taxi
- Codeforces B. Taxi 算法题解
- CC2640之配置串口打印及可变参数打印
- 【codeforces 706B Interesting drink】
- cocos2dx tolua 再见了pkg
- JVM性能调优
- 写在前面
- 【codeforces 706A Beru-taxi】
- codeforces round363b
- 达内学习笔记——引用及const
- JZOJ4699. 【NOIP2016提高A组模拟8.15】Password
- Robotium测试中关于Android 6.0 权限对话框的处理
- Hive的HQL语句及数据倾斜解决方案
- C语言中对象的点与箭头(指针)的区别
- 第一行代码Android学习(五)
- Redis+Sentinel集群安装与配置