Problem:
Score : 600 points

Problem Statement

Given are N points (x_i, y_i) in a two-dimensional plane.

Find the minimum radius of a circle such that all the points are inside or on it.

Constraints

2 \leq N \leq 50

0 \leq x_i \leq 1000

0 \leq y_i \leq 1000

The given N points are all different.

The values in input are all integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
:
x_N y_N

Output

Print the minimum radius of a circle such that all the N points are inside or on it.

Your output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.

Sample Input 1

2
0 0
1 0

Sample Output 1

0.500000000000000000

Both points are contained in the circle centered at (0.5,0) with a radius of 0.5.

Sample Input 2

3
0 0
0 1
1 0

Sample Output 2

0.707106781186497524

Sample Input 3

10
10 9
5 9
2 0
0 0
2 7
3 3
2 5
10 0
3 7
1 9

Sample Output 3

6.726812023536805158

If the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main{
    
    static final int MOD = (int)1e9+7;
    static final int MAX = (int)1e5+5;
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        
        int[] x = new int[n+1];
        int[] y = new int[n+1];
        
        for(int i=0; i<n; i++){
            x[i] = Integer.parseInt(sc.next());
            y[i] = Integer.parseInt(sc.next());
        }
        
        if(n==2){
            n++;
            x[n] = x[n-1];
            y[n] = y[n-1];
        }
        
        double min = (int)1e9;
        for(int i=0; i<n; i++){
            for(int j=i+1; j<n; j++){
                for(int k=j+1; k<n; k++){
                    //3点選ぶ
                    Circle c = calcCenter(x[i],y[i],x[j],y[j],x[k],y[k]);
                    double r = c.r;
                    double ox = c.x;
                    double oy = c.y;
                    boolean f = true;
                    for(int l=0; l<n; l++){
                        if(Math.sqrt(Math.abs(ox-x[l]) + Math.abs(oy-y[l])) < r){
                            f = false;
                            break;
                        }
                    }
                    if(f){
                        min = Math.min(min, r);
                    }
                    
                }
            }
        }
        
        System.out.println(min);
    }
    
    public static Circle calcCenter(int x1, int y1, int x2, int y2, int x3, int y3){
        double ox = 0;
        double oy = 0;
        double a = 0;
        double b = 0;
        double c = 0;
        double d = 0;
        double r1 = 0;
        double r2 = 0;
        double r3 = 0;
        double r = 0;
        
        a = x2 - x1;
        b = y2 - y1;
        c = x3 - x1;
        d = y3 - y1;
        
        if  ((a>0 && d>0) || (b>0 && c>0)) {
                ox = x1 + (d * (a * a + b * b) - b * (c * c + d * d)) / (a * d - b * c) / 2 ;
                if(b>0){
                        oy = (a * (x1 + x2 - ox - ox) + b * (y1 + y2)) / b / 2 ;
                }else{
                        oy = (c * (x1 + x3 - ox - ox) + d * (y1 + y3)) / d / 2 ;
                }
                r1   = Math.sqrt((ox - x1) * (ox - x1) + (oy - y1) * (oy - y1)) ;
                r2   = Math.sqrt((ox - x2) * (ox - x2) + (oy - y2) * (oy - y2)) ;
                r3   = Math.sqrt((ox - x3) * (ox - x3) + (oy - y3) * (oy - y3)) ;
                r  = (r1 + r2 + r3) / 3.0 ;
	}
        
        return new Circle(r, ox, oy);
    }
}

class Circle{
    public double r;
    public double x;
    public double y;
    public Circle(double r, double x, double y){
        this.r = r;
        this.x = x;
        this.y = y;
    }
}