Problem:
Score : 500 points

Problem Statement

#nck {
width: 30px;
height: auto;
}

Snuke received a triangle as a birthday present.
The coordinates of the three vertices were (x_1, y_1), (x_2, y_2), and (x_3, y_3).

He wants to draw two circles with the same radius inside the triangle such that the two circles do not overlap (but they may touch).
Compute the maximum possible radius of the circles.

Constraints

0 ≤ x_i, y_i ≤ 1000

The coordinates are integers.

The three points are not on the same line.

Input

The input is given from Standard Input in the following format:

x_1 y_1
x_2 y_2
x_3 y_3

Output

Print the maximum possible radius of the circles.
The absolute error or the relative error must be at most 10^{-9}.

Sample Input 1

0 0
1 1
2 0

Sample Output 1

0.292893218813

Sample Input 2

3 1
1 5
4 9

Sample Output 2

0.889055514217

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <cmath>
#include<bits/stdc++.h>
using namespace std;

double d(double a1, double a2, double a3, double a4){
    return(sqrt((a1-a3)*(a1-a3)+(a2-a4)*(a2-a4)));
}

int main(){
    double x1,x2,x3,y1,y2,y3;
    cin >> x1 >> y1;
    cin >> x2 >> y2;
    cin >> x3 >> y3;
    double s = abs((x2-x1)*(y3-y1)-(y2-y1)*(x3-x1))/2;
    double a1 = d(x2-x1,y2-y1,x3-x1,y3-y1);
    double a2 = d(x3-x2,y3-y2,x1-x2,y1-y2);
    double a3 = d(x1-x3,y1-y3,x2-x3,y2-y3);
    double m = max(max(a1,a2),a3);
    double r = 2*s/(a1+a2+a3);
    cout << setprecision(15) << m/(2+m/r) << endl;
}