UVA 11178 Morley’s Theorem（莫雷定理 计算几何）

Output

Foreachlineofinputyoushouldproduceonelineofoutput.Thislinecontainssixfloatingpointnumbers

separatedbyasinglespace.Thesesixfloating-point
actuallymeansthattheCartesiancoordinatesofD,EandFare

respectively.Errorslessthan

will
beaccepted.

SampleInputOutputforSampleInput

2

112212

0010005050

#include<cstdio>
#include<cmath>
#include<algorithm>
usingnamespacestd;
structPoint{
doublex,y;
Point(doublex=0,doubley=0):x(x),y(y){}
};

typedefPointVector;

Vectoroperator+(VectorA,VectorB){returnVector(A.x+B.x,A.y+B.y);}
Vectoroperator-(PointA,PointB){returnVector(A.x-B.x,A.y-B.y);}
Vectoroperator*(VectorA,doublep){returnVector(A.x*p,A.y*p);}
Vectoroperator/(VectorA,doublep){returnVector(A.x/p,A.y/p);}
booloperator<(constPoint&a,constPoint&b){
returna.x<b.x||(a.x==b.x&&a.y<b.y);
}
constdoubleeps=1e-10;
intdcmp(doublex){
if(fabs(x)<eps)return0;
returnx<0?-1:1;
}
booloperator==(constPoint&a,constPoint&b){
returndcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0;
}

doubleDot(VectorA,VectorB){returnA.x*B.x+A.y*B.y;}//点乘
doubleLength(VectorA){returnsqrt(Dot(A,A));}//向量的模
doubleAngle(VectorA,VectorB){returnacos(Dot(A,B)/Length(A)/Length(B));}//两个向量的夹角
doubleCross(VectorA,VectorB){returnA.x*B.y-A.y*B.x;}//叉乘
doubleArea(PointA,PointB,PointC){returnCross(B-A,C-A);}//三个点组成的三角形的面积
VectorRotate(VectorA,doublerad){//向量A逆时针旋转rad弧度后的坐标
returnVector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));
}

//求直线交点
PointGetLineIntersection(PointP,Vectorv,PointQ,Vectorw){
Vectoru=P-Q;
doublet=Cross(w,u)/Cross(v,w);
returnP+v*t;
}

PointgetD(PointA,PointB,PointC)
{
Vectorv1=C-B;
doublea1=Angle(A-B,v1);
v1=Rotate(v1,a1/3);

Vectorv2=B-C;
doublea2=Angle(A-C,v2);
v2=Rotate(v2,-a2/3);

returnGetLineIntersection(B,v1,C,v2);
}
intmain()
{
intT;
PointA,B,C,D,E,F;
scanf("%d",&T);
while(T--){
scanf("%lf%lf%lf%lf%lf%lf",&A.x,&A.y,&B.x,&B.y,&C.x,&C.y);
D=getD(A,B,C);
E=getD(B,C,A);
F=getD(C,A,B);
printf("%lf%lf%lf%lf%lf%lf\n",D.x,D.y,E.x,E.y,F.x,F.y);
}
return0;
}