Submission #4982029

---

Source Code Expand

#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<utility>
#include<queue>
#include<cmath>
#include<cstdio>
#include <iomanip>
#include <limits>

using namespace std;
#define REP(i, a,b) for(i=a;i<b;i++) 
#define REP1(i,b,a) for(i=b-1;i>=a;i--)
#define output(x) cout<<x<<endl;
#define pb(x) push_back(x);
typedef long long int ll;
typedef pair<ll, ll > P;
const int MOD = 1000000007;


int main() {
	ll i, j, k, l, m, n, sum, flag, cc, M, X, H, W, N,Y,Z,K;
	cc = 0;
	flag = 0;
	double x[3];
	double y[3];
	double a[3];
	REP(i, 0, 3) {
		cin >> x[i] >> y[i];

	}
	REP(i, 0, 3) {
		a[i] = sqrt((x[(i + 1) % 3] - x[i])*(x[(i + 1) % 3] - x[i]) + (y[(i + 1) % 3] - y[i])*(y[(i + 1) % 3] - y[i]));
	}
	sort(a, a + 3);
	double maxa;
	maxa = a[2];
	REP(i, 0, 3) {
	//	output(a[i]);
	}
	double r;
	r =abs((x[1] - x[0])*(y[2] - y[0]) - (x[2] - x[0])*(y[1] - y[0])) / (a[0] + a[1] + a[2]);
	double ans;
	ans = r * maxa / (2 * r + maxa);
	//output(r);
	cout << setprecision(11)<<ans << endl;


	return 0;
}

Submission Info

Judge Result