POJ 3130 How I Mathematician Wonder What You Are!

题意:同poj3335 只是顺序不同。。。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const double INF  = 1e20;
const double EPS = 1e-8;
bool zero(double t){return -EPS<t&&t<EPS;}
struct cvector{
    double x,y;
    cvector(double a,double b){x=a,y=b;}
    cvector(){}
};
cvector operator- (cvector a,cvector b){
    return cvector(a.x-b.x,a.y-b.y);
}
cvector operator+(cvector a,cvector b){
    return cvector(a.x+b.x,a.y+b.y);
}
cvector operator*(double a,cvector b){
    return cvector(a*b.x,a*b.y);
}
double operator*(cvector a,cvector b){
    return a.x*b.x+a.y*b.y;
}
double operator^(cvector a,cvector b){
    return a.x*b.y-b.x*a.y;
}
double length(double t){return t<0?-t:t;}
double length(cvector t){return sqrt(t*t);}
struct cpoint{
    double x,y;
    void get(){scanf("%lf%lf",&x,&y);}
} re[109];
cvector operator-(cpoint a,cpoint b){
    return cvector(a.x-b.x,a.y-b.y);
}
double dist(cpoint a,cpoint b){
    return length(a-b);
}
struct segline{
    cpoint a,b;
    segline(cpoint x,cpoint y){a=x,b=y;}
    segline(){}
};
cpoint intersection(segline u,segline v)
{
    cpoint ret=u.a;
    double t = ((u.a.x-v.a.x)*(v.a.y-v.b.y)-(u.a.y-v.a.y)*(v.a.x-v.b.x))/
    ((u.a.x-u.b.x)*(v.a.y-v.b.y)-(u.a.y-u.b.y)*(v.a.x-v.b.x));
    ret.x+=(u.b.x-u.a.x)*t;
    ret.y+=(u.b.y-u.a.y)*t;
    return ret;
}
int n;
bool solve()
{
    for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
    {
        if(!zero((re[i]-re[i+1])^(re[j]-re[j+1])))
        {
            cpoint xx = intersection(segline(re[i],re[i+1]),segline(re[j],re[j+1]));
            int k;
            for(k=0;k<n;k++)
            {
                if(((re[k]-re[k+1])^(xx-re[k+1]))>EPS) break;
            }
            if(k>=n) return true;
        }
    }
    return false;
}
int main()
{
    freopen("in.txt","r",stdin);
    while(~scanf("%d",&n)&&n)
    {
        for(int i=0;i<n;i++) re[i].get();
        re[n] =re[0];
        if(solve()) printf("1\n");
        else printf("0\n");
    }
    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值