Malfatti Circles

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;
struct Point{
	double x,y;
}A,B,C,I;
double dist(Point p1,Point p2){
    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
int main()
{
	//freopen("in.txt","r",stdin);
	double s,r,r1,r2,r3,a,b,c,ra,rb,rc;
    while(scanf("%lf%lf%lf%lf%lf%lf",&A.x,&A.y,&B.x,&B.y,&C.x,&C.y)){
    	if(A.x==0&&A.y==0&&B.x==0&&B.y==0&&C.x==0&&C.y==0)break;
    	a=dist(B,C);
        b=dist(A,C);
        c=dist(A,B);
        s=(a+b+c)/2;
        I.x=(a*A.x+b*B.x+c*C.x)/(a+b+c);
        I.y=(a*A.y+b*B.y+c*C.y)/(a+b+c);
        r=sqrt(s*(s-a)*(s-b)*(s-c))/s;
        ra=dist(A,I);
        rb=dist(B,I);
        rc=dist(C,I);
        r1=r/(2*(s-a))*(s-r+ra-rb-rc);
        r2=r/(2*(s-b))*(s-r+rb-ra-rc);
        r3=r/(2*(s-c))*(s-r+rc-rb-ra);
        printf("%.6f %.6f %.6f\n",r1,r2,r3);
    }
    return 0;
}