hdu 1086（判断线段相交）

判断线段是否相交，我的方法居然a掉了很奇怪！！！第200题纪念一下，同时暑假刷题开始！！！

#include <iostream>
#include <stdio.h>

using namespace std;

struct Point
{
    double x,y;
    Point(){}
    Point(double _x,double _y)
    {
        x=_x;
        y=_y;
    }
    Point operator -(const Point &b)const
    {
        return Point(x-b.x,y-b.y);
    }
    double operator ^(const Point &b)const
    {
        return x*b.y-y*b.x;
    }
    double operator *(const Point &b)const
    {
        return x*b.x+y*b.y;
    }
};

struct Line
{
    Point s,e;
    Line(){}
    Line(Point _s,Point _e)
    {
        s=_s;
        e=_e;
    }
};

Line line[105];

bool OnSeg(Line l1,Line l2)
{
    return
    ((l1.s-l2.s)^(l1.e-l2.s))*((l1.s-l2.e)^(l1.e-l2.e))<=0&&
    ((l2.s-l1.s)^(l2.e-l1.s))*((l2.s-l1.e)^(l2.e-l1.e))<=0;
}
int main()
{
    int n;
    while(1)
    {
        cin>>n;
        if(n==0)
            break;
        for(int i=0;i<n;i++)
        {
            Point a,b;
            scanf("%lf %lf %lf %lf",&a.x,&a.y,&b.x,&b.y);
            line[i]=Line(a,b);
        }
        int sum=0;
        for(int i=1;i<n;i++)
        {
            for(int j=0;j<i;j++)
            {
                if(OnSeg(line[i],line[j]))
                    sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}