POJ 1673 EXOCENTER OF A TRIANGLE

//作图证明其实就是求三角形垂心
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const double EP=1e-8;
struct Point{double x, y;};
struct Line{
    double a, b, c;
};
Line makeline(Point p1, Point p2){
    Line t1;
    int sign=1;
    t1.a=p2.y-p1.y;
    if(t1.a<0){
        t1.a*=-1;
        sign=-1;
    }
    t1.b=sign*(p1.x-p2.x);
    t1.c=sign*(p1.y*p2.x-p1.x*p2.y);
    return t1;
}
Point vert_p(Point p1, Line l1){            //垂足
    Point p2;
    p2.x=(l1.b*(l1.b*p1.x-l1.a*p1.y)-l1.a*l1.c)/(l1.a*l1.a+l1.b*l1.b);
    p2.y=(l1.a*(l1.a*p1.y-l1.b*p1.x)-l1.b*l1.c)/(l1.a*l1.a+l1.b*l1.b);
    return p2;
}
int lineintersect(Line l1, Line l2, Point &p){
    double t1=l1.a*l2.b-l2.a*l1.b;
    if(fabs(t1)<EP){
        if(fabs(l1.a*l1.c-l2.a*l2.c)<EP)
            return 0;
        return -1;
    }
    p.x=(l2.c*l1.b-l1.c*l2.b)/t1;
    p.y=(l2.a*l1.c-l1.a*l2.c)/t1;
    return 1;
}
int main(){
    //freopen("1.txt", "r", stdin);
    int n;
    Point p1, p2, p3, v1, v2, p;
    Line l1, l2;
    cin>>n;
    while(n--){
        scanf("%lf %lf %lf %lf %lf %lf", &p1.x, &p1.y, &p2.x, &p2.y,&p3.x, &p3.y);
        l1=makeline(p1, p2);
        l2=makeline(p1, p3);
        v1=vert_p(p3, l1);
        v2=vert_p(p2, l2);
        l1=makeline(p3, v1);
        l2=makeline(p2, v2);
        lineintersect(l1, l2, p);
        p.x+=EP; p.y+=EP;
        printf("%.4f %.4f\n", p.x, p.y);
    }
    return 0;
}