poj 1269 Intersecting Lines

题目：Intersecting Lines

// 求交点
// G++交 return WA
// C++交 return AC
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define eps 1e-8
struct point
{
    double x,y;
};
struct line
{
    point a,b;
};
line l[3];
double xmulti(point p1,point p2,point p0)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
// (y1-y2)x+(x2-x1)y=x2y1-x1y2
// (y3-y4)x+(x4-x3)y=x4y3-x3y4
// (u.a.y-u.b.y)x+(u.b.x-u.a.x)y=u.b.x*u.a.y-u.a.x*u.b.y
// 等效是ax+by=c  a0x+b0y=c0
// 即 ab0x+bb0y=cb0 a0bx+b0by=c0b
// x=(b0c-bc0)/(ab0-a0b)
// 其中b0=(v.b.x-v.a.x) b=(u.b.x-u.a.x)
//  c=u.b.x*u.a.y-u.a.x*u.b.y c0=v.b.x*v.a.y-v.a.x*v.b.y
//  a=(u.a.y-u.b.y) a0=(v.a.y-v.b.y)
point intersection(line u,line v)
{
    point ans;
    ans.x=((v.b.x-v.a.x)*(u.b.x*u.a.y-u.a.x*u.b.y)-
            (u.b.x-u.a.x)*(v.b.x*v.a.y-v.a.x*v.b.y))/
            ((u.a.y-u.b.y)*(v.b.x-v.a.x)-(v.a.y-v.b.y)*(u.b.x-u.a.x));
    ans.y=((v.a.y-v.b.y)*(u.b.x*u.a.y-u.a.x*u.b.y)-
           (u.a.y-u.b.y)*(v.b.x*v.a.y-v.a.x*v.b.y))/
           ((v.a.y-v.b.y)*(u.b.x-u.a.x)-(u.a.y-u.b.y)*(v.b.x-v.a.x));
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    printf("INTERSECTING LINES OUTPUT\n");
    while(t--)
    {
        for(int i=1;i<=2;i++)
            scanf("%lf%lf%lf%lf",&l[i].a.x,&l[i].a.y,&l[i].b.x,&l[i].b.y);
        if(fabs((l[1].a.x-l[1].b.x)*(l[2].a.y-l[2].b.y)-(l[1].a.y-l[1].b.y)*(l[2].a.x-l[2].b.x))<eps)
        {//平行
            if(fabs(xmulti(l[1].a,l[1].b,l[2].a))<eps)//共线
                printf("LINE\n");
            else
                printf("NONE\n");
        }
        else
        {
            point ans=intersection(l[1],l[2]);
            printf("POINT %.2lf %.2lf\n",ans.x,ans.y);
        }
    }
    printf("END OF OUTPUT\n");
    return 0;
}