Submit | All submissions | Best solutions | Back to list |
QCJ4 - Minimum Diameter Circle |
Given n points in a plane find the diameter of the smallest circle that encloses all the points. A point lying on the circle is also considered to be inside it.
Input
First line of input contains the n (<301) the number of points in the plane , followed by n lines of input. Each line gives the coordinates of one point on the plane. Each coordinate is an integer in the range [0, 1000]
Output
Output consists of a single real number, the diameter of the circle rounded to two decimal places.
Example
Input: 4 1 1 1 0 0 1 0 0 Output: 1.41
Added by: | abhijith reddy d |
Date: | 2010-02-01 |
Time limit: | 0.208s-1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS OBJC PERL6 SQLITE VB.NET |
Resource: | CCC [Own Input] |
hide comments
2013-11-22 19:42:41 M Sudeep Kumar
@abdou 00 687.53 |
|
2013-01-21 20:13:29 abdou_93
what is the answer for 5 886 383 915 777 335 793 492 386 421 649 |