ural 1963. Kite

这个题不难。其实我的方法也不难。。。但是编码能力太挫。而且可见计算几何模板化多么重要。

首先，按照题意，题目虽然说The opposite sides of the quadrangle do not intersect.还是有可能是凹四边形的。

由于只有四个点，其实符合的只有那么几种，从生活常识出发也是这样。

因此只需要判断这几种图形即可。。然后就凸显了我思维的不健全，中间犯的错误与读者分享一下。

1.对边中点连线垂直的图形有很多，对角线相等即可

2.忽略了平行四边形

3.判==0 和 判 相等 全 abs

附上最戳代码：

/*
    author:ray007great
    version:1.0
*/
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
/*  define */

#define sf(a) scanf("%d",&a)
#define sfs(a) scanf("%s",a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define rep1(i,a,b) for(int i=(a);i<(b);i++)
#define clr(a) memset(a,0,sizeof(a))
#define pfk  printf("fuck\n")

/*  define */
const double eps = 1e-7;
struct node{
    double x,y;
}po[5];
double dis(double x1,double y1,double x2,double y2){
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int main(){
    double x1,x2,x3,x4,x5,x6,x7,x8;
    double y1,y2,y3,y4,y5,y6,y7,y8;
    cin>>x1>>y1;
    cin>>x2>>y2;
    cin>>x3>>y3;
    cin>>x4>>y4;

    if(fabs(dis(x1,y1,x2,y2)-dis(x2,y2,x3,y3))<=eps&&fabs(dis(x2,y2,x3,y3)-dis(x3,y3,x4,y4))<=eps&&fabs(dis(x3,y3,x4,y4)-dis(x4,y4,x1,y1))<=eps){
        if(fabs((x1-x2)*(x2-x3)+(y1-y2)*(y2-y3))<=eps){
            cout<<"8"<<endl;
            return 0;
        }
        cout<<"4"<<endl;
        return 0;
    }
    //================================================================================================
    if(fabs(dis(x1,y1,x2,y2)-dis(x3,y3,x4,y4))<=eps){
        if(fabs(dis(x1,y1,x4,y4)-dis(x2,y2,x3,y3))<=eps&&fabs((x1-x2)*(x2-x3)+(y1-y2)*(y2-y3))<=eps){
            cout<<"4"<<endl;
            return 0;
        }
        if(fabs((x1-x4)*(y2-y3)-(x2-x3)*(y1-y4))<=eps&&fabs((x1-x2)*(y3-y4)-(x3-x4)*(y1-y2))>eps){
            cout<<"2"<<endl;
            return 0;
        }
        //fabs((x1-x2)*(y3-y4)-(x3-x4)*(y1-y2))<=eps
    }
    if(fabs(dis(x1,y1,x4,y4)-dis(x2,y2,x3,y3))<=eps){
        if(fabs(dis(x1,y1,x2,y2)-dis(x3,y3,x4,y4))<=eps&&fabs((x1-x2)*(x2-x3)+(y1-y2)*(y2-y3))<=eps){
            cout<<"4"<<endl;
            return 0;
        }
        if(fabs((x1-x2)*(y3-y4)-(x3-x4)*(y1-y2))<=eps&&fabs((x1-x4)*(y2-y3)-(x2-x3)*(y1-y4))>eps){
            cout<<"2"<<endl;
            return 0;
        }
        //fabs((x1-x4)*(y2-y3)-(x2-x3)*(y1-y4))
    }
    //================================================================================================
    if(fabs(dis(x1,y1,x4,y4)-dis(x1,y1,x2,y2))<=eps){
        if(fabs(dis(x3,y3,x4,y4)-dis(x3,y3,x2,y2))<=eps){
            cout<<"2"<<endl;
            return 0;
        }
    }
    if(fabs(dis(x2,y2,x1,y1)-dis(x2,y2,x3,y3))<=eps){
        if(fabs(dis(x4,y4,x1,y1)-dis(x4,y4,x3,y3))<=eps){
            cout<<"2"<<endl;
            return 0;
        }
    }
    if(fabs(dis(x3,y3,x2,y2)-dis(x3,y3,x4,y4))<=eps){
        if(fabs(dis(x1,y1,x2,y2)-dis(x1,y1,x4,y4))<=eps){
            cout<<"2"<<endl;
            return 0;
        }
    }
    if(fabs(dis(x4,y4,x3,y3)-dis(x4,y4,x1,y1))<=eps){
        if(fabs(dis(x2,y2,x3,y3)-dis(x2,y2,x4,y4))<=eps){
            cout<<"2"<<endl;
            return 0;
        }
    }
    cout<<"0"<<endl;
    return 0;
}