Codeforces Round #1 C subject ent Berland Circus (Computational ry)

Codeforces Round #1 C subject ent Berland Circus (Computational ry)

The idea of this question can be divided into the following four steps:

1: Calculate the radius of the external shard

2: ask for three round angles.

3: calculate the maximum common approx.

4: The maximum common divisor is the biggest inner angle of the positive polygon. Just calculate the area.

But every step won't ask .... Sad... When I think of step 2, I even think that I should use other methods .. .. The ry is too scum.

The Code is as follows:

#include 
 
  #include 
  
   #include 
   
    #include 
    
     #include #include 
     
      #include 
      #include 
       
        #include 
        
         using namespace std;#define LL __int64#define pi acos(-1.0)const int mod=100000000;const int INF=0x3f3f3f3f;const double eqs=0.01;struct Point{ double x, y;}p[4];bool dmp(double x, double y){ return fabs(x-y)