Codeforces Round #367 (Div. 2) A. Beru-taxi

A. Beru-taxi

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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.

题意：一个人位于$(x,y)$，然后给你 n <script id="MathJax-Element-68" type="math/tex">n</script>个出租车的位置，问最快接到那个人所用的时间。

思路：直接计算距离除以速度取最小值

ac代码：

/* ***********************************************
Author       : AnICoo1
Created Time : 2016-08-19-17.45 Friday
File Name    : D:\MyCode\2016-8月\2016-8-19.cpp
LANGUAGE     : C++
Copyright  2016 clh All Rights Reserved
************************************************ */
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x,y) memset(x,(y),sizeof(x))
#define PI acos(-1)
#define gn (sqrt(5.0)+1)/2
#define eps 1e-8
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,ll b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
int main()
{
    double x,y;int n;
    cin>>x>>y;cin>>n;double ans=INF*1.0;
    for(int i=1;i<=n;i++)
    {
        double nx,ny,nv;cin>>nx>>ny>>nv;
        //double dis=fabs(nx-x)+fabs(ny-y);
        double dis=sqrt((nx-x)*(nx-x)+(ny-y)*(ny-y));
        ans=min(ans,dis/nv);
    }
    printf("%.7lf\n",ans);
    return 0;
}