线段相交

• Description

你将判断给定线段L1，L2是否相交, 其中L1表示为s1x,s1y,e1x,e1y，L2表示为s2x,s2y,e2x,e2y

• Input

多组数据输入，每组一行，每组八个浮点数，s1x,s1y,e1x,e1y,s2x,s2y,e2x,e2y

• Output

相交则输出yes否则输出no

• Sample Input

0 1 2 1 1 0 1 2
1 1 2 2 3 3 4 4

• Sample Output

yes
no

#include<cstdio>
#include<cstring>
#include<cstring>
#include<cstdlib>
const double eps=1e-10;
struct point { double x, y; };
double min(double a, double b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
bool inter(point a, point b, point c, point d){
if ( min(a.x, b.x) > max(c.x, d.x) ||
min(a.y, b.y) > max(c.y, d.y) ||
min(c.x, d.x) > max(a.x, b.x) ||
min(c.y, d.y) > max(a.y, b.y) ) return 0;
double h, i, j, k;
h = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
i = (b.x - a.x) * (d.y - a.y) - (b.y - a.y) * (d.x - a.x);
j = (d.x - c.x) * (a.y - c.y) - (d.y - c.y) * (a.x - c.x);
k = (d.x - c.x) * (b.y - c.y) - (d.y - c.y) * (b.x - c.x);
return h * i <= eps && j * k <= eps;
}

int main(){
    point a,b,c,d;
    int tru;
    while(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)!=EOF){
        tru=inter(a,b,c,d);
        if(tru)
            printf("yes\n");
        else
            printf("no\n");
    }
    return 0;
}