计算几何入门1--poj1269Intersecting Lines

题目大意：给你一坨直线，求他们之间的关系

计算几何入门好题，我用斜率写的，神烦

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const double eps=1e-10;
const int maxn=100+10;
int n,m;
struct point{
    double x,y;
}p[maxn],c[maxn];
void calc(point *p,double &k,double &b){//y=kx+b,神犇勿喷 
    double x1=p[1].x,x2=p[2].x;
    double y1=p[1].y,y2=p[2].y;
    if (abs(x2-x1)<eps) k=0;//**
    else k=(y2-y1)/(x2-x1);
    b=y1-k*x1;
}

bool ok(double x,double y){
    return abs(x-y)<eps;
}

bool check(){//垂直 
    double x1=p[1].x,x2=p[2].x;
    double y1=p[1].y,y2=p[2].y;
    double x3=c[1].x,x4=c[2].x;
    double y3=c[1].y,y4=c[2].y;
    if (ok(x1,x2)&&ok(y3,y4)) printf("POINT %.2f %.2f\n",x1,y3);//到底那条是横哪条是竖 
    else if ((ok(y1,y2)&&ok(x3,x4))) printf("POINT %.2f %.2f\n",x3,y1);
    else return 0;
    return 1;
}

bool jud(){//斜率为0也有可能平行 
    double x1=p[1].x,x2=p[2].x;
    double y1=p[1].y,y2=p[2].y;
    double x3=c[1].x,x4=c[2].x;
    double y3=c[1].y,y4=c[2].y;
    return ((ok(x1,x3)&&ok(x1,x2)&&ok(x2,x4))||(ok(y1,y2)&&ok(y2,y3)&&ok(y3,y4)));
    //斜率都为0且x相等或y相等时平行 
}

void work(){
    double k1,k2,b1,b2;
    k1=k2=b1=b2=0;
    calc(p,k1,b1); calc(c,k2,b2);
    if (k1==k2&&k1==0)
         if (check()) return ;
    if (k1==k2){
        double x=rand()%100+1;
        double ans1=k1*x+b1;
        double ans2=k2*x+b2;        
        if (abs(ans1-ans2)<eps||(k1==0&&jud())) printf("LINE\n");
        else printf("NONE\n");
        return ;
    }else{
        double ansx=(b2-b1)/(k1-k2);
        double ansy=ansx*k1+b1;
        printf("POINT %.2f %.2f\n",ansx,ansy);
    }
}

int main(){
    printf("INTERSECTING LINES OUTPUT\n");
    scanf("%d",&n);
    for (int i=1;i<=n;++i){
        for (int j=1;j<=2;++j)
            scanf("%lf%lf",&p[j].x,&p[j].y);
        for (int j=1;j<=2;++j)
            scanf("%lf%lf",&c[j].x,&c[j].y);
        work();
    }
    printf("END OF OUTPUT");
}

友情附上别人的模板，orzzzzzzzzzzzzzzzzzzzzzzz
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#define eps 1e-8
#define zero(x) (((x)>0?(x):-(x))<eps)
#define N 40
using namespace std;
struct point{
    double x, y;
} p1, p2, p3, p4;

// 判两直线平行
bool Parallel(point u1, point u2, point v1, point v2){
    return zero((u1.x-u2.x)*(v1.y-v2.y)-(v1.x-v2.x)*(u1.y-u2.y));
}

// 计算cross product (P1-P0)x(P2-P0)
double Xmult(point p1, point p2, point p0){
    return (p1.x-p0.x)*(p2.y-p0.y) - (p2.x-p0.x)*(p1.y-p0.y);
}

// 两点距离
double Distance(point p1,point p2){
    return sqrt((p1.x-p2.x)*(p1.x-p2.x) + (p1.y-p2.y)*(p1.y-p2.y));
}

// 点到直线距离
double Disptoline(point p, point l1, point l2){
    return fabs(Xmult(p, l1, l2)) / Distance(l1, l2);
}

// 计算两直线交点,注意事先判断直线是否平行
point Intersection(point u1, point u2, point v1, point v2){
    point ret = u1;
    double t = ((u1.x-v1.x)*(v1.y-v2.y) - (u1.y-v1.y)*(v1.x-v2.x))
             / ((u1.x-u2.x)*(v1.y-v2.y) - (u1.y-u2.y)*(v1.x-v2.x));
    ret.x += (u2.x-u1.x) * t;
    ret.y += (u2.y-u1.y) * t;
    return ret;
}

int main(){
    int n, x1, y1, x2, y2, x3, y3, x4, y4;
    scanf("%d", &n);
    printf("INTERSECTING LINES OUTPUT\n");
    while(n--){
        scanf("%d %d %d %d %d %d %d %d", &x1, &y1, &x2, &y2, &x3, &y3, &x4, &y4);
        p1.x = x1, p1.y = y1;
        p2.x = x2, p2.y = y2;
        p3.x = x3, p3.y = y3;
        p4.x = x4, p4.y = y4;
        if(Parallel(p1, p2, p3, p4)){
            if(zero(Disptoline(p2, p3, p4)))printf("LINE\n");
            else printf("NONE\n");
        }
        else{
            point p = Intersection(p1, p2, p3, p4);
            printf("POINT %.2lf %.2lf\n", p.x, p.y);
        }
    }
    printf("END OF OUTPUT\n");
    return 0;
}