提示: 欢迎访问OurACM平台。
Problem 1744 Fishing

Accept: 25    Submit: 40
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

Yayamao is duck or a cat,I don't care.I just know he like to fishing. In the fuzhou university,there are too many lakes and too many fish in it.As a best angler,yayamao just went to hunt the fish king(best of all fish at weight).He throw bait direction to the fish king. If the fishs see the bait made by yayamao, they will come closer as fast as possible and the first will eat the bait and be hunt by yayamao. If two or more fishs come to bait at the same time,they will fight and the biger one can eat the bait.yayamao is too lazy,so he went to know the min distance the bait he must do.(yayamao at the position of (0,0)).

Input

There will be several test cases. The first line of cases will contain a single positive integer N (1<N<=100)giving the number of fish in the lake. The next N line describes N fishs.Each fish describes as three integer {x,y,w}.distinct (x,y) discribes the position of the fish, and distinct w is the weight.

Output

For each test case, output only contain one line. Output the min distance he throw bait that he can fishing the fish king and answer should rounded to 0.01.

Sample Input

3 10 10 100 5 5 10 3 3 10 2 10 10 100 7 8 10 7 13 451 172 37 517 800 163 341 893 260 318 63 488 914 401 580 892 874 677 247 193

Sample Output

10.61 12.30 0.00

Source

FOJ-2009年5月月赛

Submit  Back  Status  Discuss