poj 1269 Intersecting Lines （求直线交点）

原题友情链接快速通道~直通车鼠标轻戳此处打开~poj 1269

简单的计算几何的题目。

只要考虑好直线的斜率为0和斜率不存在两种情况即可。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
typedef struct
{
    double x,y;
} point;
typedef struct
{
    double k,c;
    int flag;
} line;
line line_solve(point a,point b)/*求出直线的信息*/
{
    line l;
    if( a.y - b.y == 0)
    {
        l.k = 0;
        l.c = a.y;
        l.flag = 1;/*标记垂直于y轴*/
    }
    else if(a.x - b.x == 0)
    {
        l.k =0;
        l.c = a.x;
        l.flag = 2;/*标记垂直于x轴*/
    }
    else
    {
        l.k = (a.y - b.y)/(a.x - b.x);
        l.c = a.y - a.x*l.k;
        l.flag = 3;/*其他直线*/
    }
    return l;
}
point point_solve(line a,line b)/*求两直线交点*/
{
    point ans;
    if(a.k == b.k)/*两条直线正好彼此垂直于坐标轴*/
    {
        if(a.flag == 2)
        {
            ans.x = a.c;
            ans.y = b.c;
        }
        else
        {
            ans.x = b.c;
            ans.y = a.c;
        }
    }
    else
    {
        ans.x = (b.c - a.c)/(a.k - b.k);
        ans.y = a.k*ans.x + a.c;
    }
    return ans;
}
int main()
{
    int ncase;
    scanf("%d",&ncase);
    bool flag = false;
    while(ncase--)
    {
        point a,b,c,d;
        scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&d.x,&d.y);
        line n,m;
        n = line_solve(a,b);
        m = line_solve(c,d);
        if(!flag)
        {
            printf("INTERSECTING LINES OUTPUT\n");
            flag = true;
        }
        if(n.k == m.k && n.c == m.c && n.flag == m.flag)
        {
            printf("LINE\n");
        }
        else if(n.k == m.k && n.c != m.c && n.flag == m.flag)
        {
            printf("NONE\n");
        }
        else
        {
            point k = point_solve(n,m);
            printf("POINT %.2lf %.2lf\n",k.x,k.y);
        }
    }
    printf("END OF OUTPUT\n");
    return 0;
}