题目地址:点这里
额,但是强烈建议看pdf版本的啊 ,不然有可能会presentation error 。 pdf版
首先要注意 有可能出现凹四边形。 只要出现那只能是普通四边形了。
然后是把点排成A,B,C,D 这样。
然后就是对定义的把握了
代码:
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
const long double eps=1e-10;
using namespace std;
struct Point{
long double x;
long double y;
Point(long double x=0,long double y=0):x(x),y(y){}
void operator<<(Point &A) {cout<<A.x<<' '<<A.y<<endl;}
};
int dcmp(long double x) {return (x>eps)-(x<-eps); }
typedef Point Vector;
Vector operator +(Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y);}
Vector operator -(Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }
Vector operator *(Vector A,long double p) { return Vector(A.x*p,A.y*p); }
Vector operator /(Vector A,long double p) {return Vector(A.x/p,A.y/p);}
// ps cout
ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}
bool operator< (const Point &A,const Point &B) { return A.x<B.x||(A.x==B.x&&A.y<B.y); }
bool operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}
long double Dot(Vector A,Vector B) {return A.x*B.x+A.y*B.y;}
long double Cross(Vector A,Vector B) {return A.x*B.y-B.x*A.y; }
long double Length(Vector A) { return sqrt(Dot(A, A));}
long double Angle(Vector A,Vector B) {return acos(Dot(A,B)/Length(A)/Length(B));}
long double Area2(Point A,Point B,Point C ) {return Cross(B-A, C-A);}
Vector Rotate(Vector A,long double rad) { return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
Vector Normal(Vector A) {long double L=Length(A);return Vector(-A.y/L,A.x/L);}
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w)
{
Vector u=P-Q;
long double t=Cross(w, u)/Cross(v,w);
return P+v*t;
}
long double DistanceToLine(Point P,Point A,Point B)
{
Vector v1=P-A; Vector v2=B-A;
return fabs(Cross(v1,v2))/Length(v2);
}
long double DistanceToSegment(Point P,Point A,Point B)
{
if(A==B) return Length(P-A);
Vector v1=B-A;
Vector v2=P-A;
Vector v3=P-B;
if(dcmp(Dot(v1,v2))==-1) return Length(v2);
else if(Dot(v1,v3)>0) return Length(v3);
else return DistanceToLine(P, A, B);
}
Point GetLineProjection(Point P,Point A,Point B)
{
Vector v=B-A;
Vector v1=P-A;
long double t=Dot(v,v1)/Dot(v,v);
return A+v*t;
}
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
long double c1=Cross(b1-a1, a2-a1);
long double c2=Cross(b2-a1, a2-a1);
long double c3=Cross(a1-b1, b2-b1);
long double c4=Cross(a2-b1, b2-b1);
//cout<<c1<<c2<<c3<<c4<<endl;
return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0 ;
}
bool OnSegment(Point P,Point A,Point B)
{
return dcmp(Cross(P-A, P-B))==0&&dcmp(Dot(P-A,P-B))<0;
}
long double PolygonArea(Point *p,int n)
{
long double area=0;
for(int i=1;i<n-1;i++)
{
area+=Cross(p[i]-p[0], p[i+1]-p[0]);
}
return area/2;
}
Point read_point()
{
Point P;
scanf("%Lf%Lf",&P.x,&P.y);
return P;
}
int nearest(long double p)
{
int a=floor(p);
int b=ceil(p);
if(p-a>=b-p) return b;
else return a;
}
bool is_Square(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D))
{
Point temp=B;
B=C;
C=temp;
}
else if(SegmentProperIntersection(A, D, B, C))
{
Point temp=C;
C=D;
D=temp;
}
if(dcmp(Cross(A-B, C-D))==0&&dcmp(Cross(A-D,B-C))==0&&dcmp(Dot(A-B,B-C))==0&&dcmp(Length(A-B)-Length(C-B))==0)
return 1;
else return 0;
}
bool is_Rectangle(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D))
{
Point temp=B;
B=C;
C=temp;
}
else if(SegmentProperIntersection(A, D, B, C))
{
Point temp=C;
C=D;
D=temp;
}
if(dcmp(Cross(A-B, C-D))==0&&dcmp(Cross(A-D,B-C))==0&&dcmp(Dot(A-B,B-C))==0) return 1;
else return 0;
}
bool is_Rhombus(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D))
{
Point temp=B;
B=C;
C=temp;
}
else if(SegmentProperIntersection(A, D, B, C))
{
Point temp=C;
C=D;
D=temp;
}
if(dcmp(Cross(A-B, C-D))==0&&dcmp(Cross(A-D,B-C))==0&&dcmp(Length(A-B)-Length(C-B))==0) return 1;
else return 0;
}
bool is_Parallelogram(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D))
{
Point temp=B;
B=C;
C=temp;
}
else if(SegmentProperIntersection(A, D, B, C))
{
Point temp=C;
C=D;
D=temp;
}
if(dcmp(Cross(A-B, C-D))==0&&dcmp(Cross(A-D,B-C))==0) return 1;
else return 0;
}
bool is_Trapezium(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D))
{
Point temp=B;
B=C;
C=temp;
}
else if(SegmentProperIntersection(A, D, B, C))
{
Point temp=C;
C=D;
D=temp;
}
if(dcmp(Cross(A-B, C-D))==0&&dcmp(Cross(A-D, B-C))!=0) return 1;
else if(dcmp(Cross(B-C, A-D))==0&&dcmp(Cross(A-B, C-D))!=0) return 1;
else return 0;
}
bool is_convex(Point A,Point B,Point C,Point D)
{
if(SegmentProperIntersection(A, B, C, D)||SegmentProperIntersection(A, C, B, D)||SegmentProperIntersection(A, D, B, C)) return 1;
else return 0;
}
int main()
{
int T;
cin>>T;
Point A,B,C,D;
for(int l=0;l<T;l++)
{
A=read_point();
B=read_point();
C=read_point();
D=read_point();
cout<<"Case "<<l+1<<": ";
if(!is_convex(A, B, C, D))
{
cout<<"Ordinary Quadrilateral"<<endl;
}
else
if(is_Square(A, B, C, D))
{
cout<<"Square"<<endl;
}
else if(is_Rectangle(A, B, C, D))
{
cout<<"Rectangle"<<endl;
}
else if(is_Rhombus(A,B,C,D))
{
cout<<"Rhombus"<<endl;
}
else if(is_Parallelogram(A, B, C, D))
{
cout<<"Parallelogram"<<endl;
}
else if(is_Trapezium(A,B,C,D))
{
cout<<"Trapezium"<<endl;
}
else cout<<"Ordinary Quadrilateral"<<endl;
}
}