UVA 378 Intersecting Lines

最新推荐文章于 2020-10-26 19:25:48 发布

原创最新推荐文章于 2020-10-26 19:25:48 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#UVA #uva #UVA 378 #ACM

本文提供了一种解决UVA378交叉线段问题的代码实现方案，详细介绍了如何通过分类讨论来判断两条线段的交点情况，包括无交点、共线或相交于一点，并提供了完整的C++代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

UVA 378 Intersecting Lines

根据题意编代码即可
注意：分类讨论很可能因为过于混乱出错，因此，代码格式很重要（看得更加清楚），建议不用else

CODE:

#include<iostream>
#include<cstdio>
using namespace std;

int n,x_1,y_1,x_2,y_2,x_3,y_3,x_4,y_4;
double k_1,k_2,b_1,b_2,pointx,pointy;

int main()
{
    int ok=1;
    cin >> n;
    cout << "INTERSECTING LINES OUTPUT" << endl;
    while(n&&cin>>x_1>>y_1>>x_2>>y_2>>x_3>>y_3>>x_4>>y_4)
    {
            n--;
            if(x_1==x_2)
            {
                if(x_3==x_4)
                {
                    if(x_3==x_1){cout << "LINE" << endl;continue;}
                    if(x_3!=x_1){cout << "NONE" << endl;continue;}
                }
                if(x_3!=x_4)
                {
                    k_2=(double)(y_3-y_4)/(x_3-x_4);
                    b_2=(double)(x_3*(y_3+y_4)-y_3*(x_3+x_4))/(x_3-x_4);
                    pointx=x_1;
                    pointy=x_1*k_2+b_2;
                    printf("POINT %.2f %.2f\n",pointx,pointy);
                    continue;
                }
            }
            if(x_1!=x_2)
            {
                if(x_3==x_4)
                {
                    k_1=(double)(y_1-y_2)/(x_1-x_2);
                    b_1=(double)(x_1*(y_1+y_2)-y_1*(x_1+x_2))/(x_1-x_2);
                    pointx=x_3;
                    pointy=x_3*k_1+b_1;
                    printf("POINT %.2f %.2f\n",pointx,pointy);
                    continue;
                }
                if(x_3!=x_4)
                {
                    if((x_1-x_2)*(y_3-y_4)==(x_3-x_4)*(y_1-y_2))
                    {
                        b_1=(double)(x_1*(y_1+y_2)-y_1*(x_1+x_2))/(x_1-x_2);
                        b_2=(double)(x_3*(y_3+y_4)-y_3*(x_3+x_4))/(x_3-x_4);
                        if(b_1==b_2){cout << "LINE" << endl;continue;}
                        if(b_1!=b_2){cout << "NONE" << endl;continue;}
                    }
                    if((x_1-x_2)*(y_3-y_4)!=(x_3-x_4)*(y_1-y_2))
                    {
                        k_1=(double)(y_1-y_2)/(x_1-x_2);
                        b_1=(double)(x_1*(y_1+y_2)-y_1*(x_1+x_2))/(x_1-x_2);
                        k_2=(double)(y_3-y_4)/(x_3-x_4);
                        b_2=(double)(x_3*(y_3+y_4)-y_3*(x_3+x_4))/(x_3-x_4);
                        pointx=(double)(b_1-b_2)/(k_2-k_1);
                        pointy=(double)(pointx*k_1+b_1);
                        printf("POINT %.2f %.2f\n",pointx,pointy);
                        continue;
                    }
                }
            }
    }
    cout << "END OF OUTPUT" << endl;
    return 0;
}

输出OUTPUT:

done...