zoj 2675 Little Mammoth 圆与四边形的公共面积

题目地址:zoj2675

和上面两题完全一样的，额，话说去年暑假集训的时候没人做出来啊。

额，zoj 的g++对long double 的支持还是很好的

代码：

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
const  long double eps=1e-10;
const long double PI=acos(-1.0);

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); }
int sgn(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);}



ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}
//
bool  operator< (const Point &A,const Point &B) { return dcmp(A.x-B.x)<0||(dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)<0); }

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 Get