zoj 1081

# include <stdio.h>
# include <math.h>
# include <algorithm>
# define eps 1e-6
using namespace std;
struct node
{
    double x,y;
}vex[109];
int n,m;
int zero(double x)
{
    return ((x)>0?(x):(-x))<eps;
}
double max(double x,double y)
{
    return x>y?x:y;
}
double cross(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
int on(node a,node b,node c)
{
    double maxx=a.x>b.x?a.x:b.x;
    double minx=a.x<b.x?a.x:b.x;
    if(zero(cross(a,b,c))==1&&c.x>=minx&&c.x<=maxx)
        return 1;
    else
        return 0;
}
int inser(node a,node b,node c,node d)
{
    double d1=cross(a,b,c);
    double d2=cross(a,b,d);
    double d3=cross(c,d,a);
    double d4=cross(c,d,b);
    if(d1*d2<0&&d3*d4<0)
        return 1;
    if(zero(d1*d2)&&on(a,b,c))
        return 1;
    if(zero(d1*d2)&&on(a,b,d))
         return 1;
    if(zero(d3*d4)&&on(c,d,a))
         return 1;
    if(zero(d3*d4)&&on(c,d,b))
         return 1;
    return 0;
}
int solve(node p)
{
    node q;
    q.x=1e10;
    q.y=p.y;
    int cnt=0;
    for(int i=0;i<n;i++)
    {
        int tmp=-1;
        if(on(vex[i],vex[i+1],p))
            return 1;
        if(!zero(vex[i].y-vex[i+1].y))
        {
            if(on(p,q,vex[i]))
                tmp=i;
            else if(on(p,q,vex[i+1]))
                tmp=i+1;
            if(tmp==-1&&inser(p,q,vex[i],vex[i+1]))
                cnt++;
            double ans=max(vex[i].y,vex[i+1].y);
            if(tmp!=-1&&zero(vex[tmp].y-ans))
                cnt++;
        }
    }
    return cnt%2;
}
int main()
{
    int mark=0,cas=0;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0) break;
        if(mark==1) printf("\n");
        scanf("%d",&m);
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&vex[i].x,&vex[i].y);
        }
        vex[n]=vex[0];
        node p;
        printf("Problem %d:\n",++cas);
        for(int i=0;i<m;i++)
        {
            scanf("%lf%lf",&p.x,&p.y);
            int ans=solve(p);
            if(ans)
                printf("Within\n");
            else
                printf("Outside\n");
        }
        mark=1;
    }
    return 0;
}

加上了一个zero的精确度的判断。。。。lol  记住读数据的时候用double  也就是%lf