Minimum Enclosing Circle
Time Limit : 1 Second
Memory Limit : 128 MB
Submission: 223
Solved: 49
 Description
Their are N unique points on 2D 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
BruteForce algorithm is recommended.
 source
 Xu Han, HUST Campus 2010, Preliminary