poj 1410 计算几何

 /**
 注意： 千万得小心。。就因为一个分号，调了一个晚上。。。
 **/
 #include <iostream>
 #include <algorithm>
 using namespace std;
 struct point {
     int x,y;
 };

 struct line{
     point a;
     point b;
 };
 line l,lt;//l 直线 lt 矩形的边
 int x1,x2,y1,y2;

 int mmax(double a,double b){
     return a>b?a:b;
 }

 int mmin(double a,double b){
     return a<b?a:b;
 }

 double dir(point o,point p,point   q){
     return (p.x-o.x)*(q.y-o.y)-(p.y-o.y)*(q.x-o.x);
 }

 int on_border(point o,point p,point q){
     if(mmin(o.x,p.x)<=q.x&&q.x<=mmax(o.x,p.x)&&mmin(o.y,p.y)<=q.y&&q.y<=mmax(o.y,p.y))
         return ;
     else
         return ;
 }

 int cross(line v,line t){
     double a,b,c,d;
     a = dir(t.a,t.b,v.a);
     b = dir(t.a,t.b,v.b);
     c = dir(v.a,v.b,t.a);
     d = dir(v.a,v.b,t.b);
     if(a*b<&&c*d<)
         return ;
     if(!a&&on_border(t.a,t.b,v.a))
         return ;
     if(!b&&on_border(t.a,t.b,v.b))
         return ;
     if(!c&&on_border(v.a,v.b,t.a))
         return ;
     if(!d&&on_border(v.a,v.b,t.b))
         return ;
     return ;
 }

 int main()
 {
     int n;
     cin>>n;
     while(n--){
         cin>>l.a.x>>l.a.y>>l.b.x>>l.b.y;
         cin>>x1>>y1>>x2>>y2;
         if(x1>x2)
             swap(x1,x2);
         if(y1<y2)
             swap(y1,y2);
         int flag =;
         lt.a.x = x1;
         lt.a.y=y1;
         lt.b.x = x2;
         lt.b.y =y1;
         if(cross(l,lt))
             flag =;
         else{
             lt.a.x=x2;
             lt.a.y=y1;
             lt.b.x=x2;
             lt.b.y=y2;
             if(cross(l,lt))
                 flag =;
             else{
                 lt.a.x=x1;
                 lt.a.y=y2;
                 lt.b.x=x2;
                 lt.b.y=y2;
                 if(cross(l,lt))
                     flag =;
                 else{
                     lt.a.x = x1;
                     lt.a.y=y1;
                     lt.b.x=x1;
                     lt.b.y=y2;
                     if(cross(l,lt))
                         flag =;
                 }
             }
         }
         if(flag)
             cout<<"T"<<endl;
         else{
             if((x1<mmin(l.a.x,l.b.x))&&(mmax(l.a.x,l.b.x)<x2)&&(y2<mmin(l.a.y,l.b.y))&&(mmax(l.a.y,l.b.y)<y1))
                 cout<<"T"<<endl;
             else
                 cout<<"F"<<endl;
         }
     }
     return ;
 }