1C Ancient Berland Circus 二维几何+浮点数取馍

C. Ancient Berland Circus

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

Nowadays all circuses in Berland have a round arena with diameter 13 meters, but in the past things were different.

In Ancient Berland arenas in circuses were shaped as a regular (equiangular) polygon, the size and the number of angles could vary from one circus to another. In each corner of the arena there was a special pillar, and the rope strung between the pillars marked the arena edges.

Recently the scientists from Berland have discovered the remains of the ancient circus arena. They found only three pillars, the others were destroyed by the time.

You are given the coordinates of these three pillars. Find out what is the smallest area that the arena could have.

Input

The input file consists of three lines, each of them contains a pair of numbers –– coordinates of the pillar. Any coordinate doesn't exceed 1000 by absolute value, and is given with at most six digits after decimal point.

Output

Output the smallest possible area of the ancient arena. This number should be accurate to at least 6 digits after the decimal point. It's guaranteed that the number of angles in the optimal polygon is not larger than 100.

Examples

Input

0.000000 0.000000
1.000000 1.000000
0.000000 1.000000

Output

1.00000000

 题意：三个点组成一个正多边形（一定可以组成），让你找一个面积最小的。
解题思路：外接圆+浮点数取模即可+套用刘汝佳的几何模板，精度需要纠结一下。

#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const double eps = 1e-2 ;
const double PI = acos(-1) ;
struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}///构造函数
};
int dcmp(double x){
    if(fabs(x)<eps)return 0;///精度范围内认为等于0
    else return x<0?-1:1 ;///小于0返回-1，大于0返回1
}
typedef Point Vector ;
double gcd(double x,double y){return dcmp(y)==0?x:gcd(y,fmod(x,y));}
double Dot(Vector A,Vector B){return A.x*B.x + A.y*B.y ;}
double Length(Vector A){return sqrt(Dot(A,A));}
double Angle(Vector A,Vector B){return acos(Dot(A,B)/Length(A)/Length(B)) ;}
Vector operator - (Point A,Point B){return Vector(A.x-B.x,A.y-B.y);}
int main(){
    Point a,b,c;
    scanf("%lf %lf",&a.x,&a.y);
    scanf("%lf %lf",&b.x,&b.y);
    scanf("%lf %lf",&c.x,&c.y);
    Vector x1 = a-b;
    Vector x2 = a-c;
    Vector x3 = b-c ;
    double s = Angle(x1,x2) ;
    double R = (Length(x3)/sin(s))/2 ;
    float th  ;
    th = 1-Length(x1)*Length(x1)/(2*R*R) ;
    double r1 = acos(th) ;
    th = 1-Length(x2)*Length(x2)/(2*R*R) ;
    double r2 = acos(th) ;
    //th = 1-Length(x3)*Length(x3)/(2*R*R);
    //double r3 = acos(th) ;
    double r3 = 2*PI-r1-r2 ;

    double temp = gcd(r3,gcd(r1,r2)) ;
    double ans = R*R*sin(temp)/2*(2*PI/temp) ;
    printf("%lf\n",ans);
    return 0;
}