poj管道光线的最远距离

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
#define rd(x) scanf("%d",&x)
#define rdd(x,y) scanf("%d%d",&x,&y)
#define rddd(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define rdddd(x,y,z,w) scanf("%d%d%d%d",&x,&y,&z,&w)
#define rds(s) scanf("%s",s)
#define rep(i,n) for(int i=0;i<n;i++)
#define LL long long
const int N = 1e5+10;
const int M=5e5+10;
const int inf=1e9;
const double eps=1e-8;
const int MOD=1e9+7;
int n,m,k;
struct Point{
    double x,y;
    Point(){}
    Point(double _x,double _y){
        x=_x;y=_y;
    }
    void print(){
        printf("x: %f y: %f\n",x,y);
    }
};
struct Seg{
    Point s,e;
    Seg(){}
    Seg(Point _s,Point _e){
        s=_s;e=_e;
    }
    Seg(double u,double v,double w,double z){
        s.x=u;s.y=v;
        e.x=w;e.y=z;
    }
};
int sgn(double x){return x<-eps?-1:x<eps?0:1;}
double cross(Point a,Point b,Point c){
    return (b.y-a.y)*(c.x-a.x)-(b.x-a.x)*(c.y-a.y);
}
Point intersection(Point p1,Point p2,Point p3,Point p4){
    double a1=p1.y-p2.y;
    double b1=p2.x-p1.x;
    double c1=p1.x*p2.y-p2.x*p1.y;

    double a2=p3.y-p4.y;
    double b2=p4.x-p3.x;
    double c2=p3.x*p4.y-p4.x*p3.y;

    double x=(c2*b1-c1*b2)/(a1*b2-a2*b1);
    double y=(c2*a1-c1*a2)/(a2*b1-a1*b2);
    return Point(x,y);
}
bool check(Point p1,Point p2,Point p3,Point p4){
    int  ret1=sgn(cross(p1,p2,p3));
    int ret2=sgn(cross(p1,p2,p4));
    return ret1*ret2<=0;
}
bool check1(Point p1,Point p2,Point p3,Point p4){
      int  ret1=sgn(cross(p1,p2,p3));
    int ret2=sgn(cross(p1,p2,p4));
    return ret1*ret2<0;
}
Point a[100],b[100];
double ans;
int main()
{
#ifndef ONLINE_JUDGE
freopen("aaa","r",stdin);
#endif
    int T;
    while(cin>>n,n){
            for(int i=1;i<=n;i++){
                    double u,v;
                    cin>>u>>v;
                    a[i]=Point(u,v);
                    b[i]=Point(u,v-1);
            }
            ans=-inf;
            if(n<3) ans=a[n].x+1;
            for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++) if(check(a[i],b[j],a[1],b[1])){
                for(k=2;k<=n;k++){
                    if(!check(a[i],b[j],a[k],b[k])){
                        if(check1(a[i],b[j],a[k-1],a[k])){
                            Point tmp=intersection(a[i],b[j],a[k-1],a[k]);
                          //  if(tmp.x>ans) {a[i].print();b[j].print();cout<<k<<endl;}
                            ans=max(ans,tmp.x);
                        }else if(check1(a[i],b[j],b[k-1],b[k])){
                            Point tmp=intersection(a[i],b[j],b[k-1],b[k]);
                          //   if(tmp.x>ans) {a[i].print();b[j].print();cout<<k<<endl;}
                            ans=max(ans,tmp.x);
                        }
                        break;
                    }
                }
                if(k>n){ans=a[n].x+1;}
            }

            if(ans>=a[n].x) puts("Through all the pipe.");
            else printf("%.2f\n",ans);
    }
    return 0;
}