eolymp
bolt
Try our new interface for solving problems
Problems

Minimal Circle

Minimal Circle

You are to write a program to find a circle which covers a set of points and has the minimal area. There will be no more than \textbf{100} points in one problem. \InputFile The input contains several problems. The first line of each problem is a line containing only one integer \textbf{N} which indicates the number of points to be covered. The next \textbf{N} lines contain \textbf{N} points. Each point is represented by \textbf{x} and \textbf{y} coordinates separated by a space. After the last problem, there will be a line contains only a zero. \OutputFile For each input problem, you should give a one-line answer which contains three numbers separated by spaces. The first two numbers indicate the \textbf{x} and \textbf{y} coordinates of the result circle, and the third number is the radius of the circle. (use escape sequence \textbf{\%.2f})
Time limit 10 seconds
Memory limit 64 MiB
Input example #1
2
0.0 0.0
3 0
5
0 0
0 1
1 0
1 1
2 2
0
Output example #1
1.50 0.00 1.50
1.00 1.00 1.41