1418 - Minimum Enclosing Circle

Time Limit: 1s Memory Limit: 128MB

Submissions: 223 Solved: 49
Description

Their are N unique points on 2-D plane, find a minimum circle that can enclose all the points.
 

Input

multiple cases ended with EOF.
for each case:
first line: N (1 < N < 10)
next N lines each contains two integers indicating the coordinate of the ith point: xi, yi (-1000 < xi,yi < 1000)
 

Output

for each case, output one line containing the radius of the minimum circle you find, rounded to two digit after the dot.

Sample Input
2
0 0
2 0
3
0 0
2 0
0 2
Sample Output
1.00
1.41
Hint

Brute-Force algorithm is recommended.

Source
Xu Han, HUST Campus 2010, Preliminary