CF 1C.Ancient Berland Circus

有点慢的CF

Description

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

题意

给出一个正多边形的其中三个点坐标,然后求这个正多边形的最小面积.

思路

某人一看这题:“显然,把这三个点连起来,这就是个三角形”
废话不多说,直接上图emmm,首先这三个点都位于一个正多边形上.那么,站在这个正多边形的角度上,这三个点到这个正多边形的中心的距离一定是相等的,对不对?那站在三角形的角度上,到三角形三个点的距离都相等的点只有这个三角形外接圆的圆心,如图所示,三角形外接圆圆心与正多边形中心重合.

那么该怎么求这个正多边形的面积呢?

接下来就要用上我这个蒟蒻看得半懂不懂的Math部分了.

已知的是三角形三点坐标，借此可以求出三角形三边长$a,b,c$，结合海伦公式 $S_{\Delta ABC}=\sqrt{p(p-a)(p-b)(p-c)}(p=\frac{a+b+c}{2})$可以求得三角形面积。

可以证明$S_{\Delta ABC}=\frac{a{h}_a}{2}=\frac{ab\sin C}{2}$​，结合正弦定理$\frac{a}{\sin A}=\frac{b}{\sin B}=\frac{c}{\sin C}=2R$即可得出三角形外接圆半径$R=\frac{abc}{4S_{\Delta ABC}}$。

根据余弦定理分别求出三角形三边作为弦所对的圆心角的三角函数值，使用反三角函数求出圆心角的度数，由于圆心角的度数皆为正多边形中心角度数的倍数，可以通过求圆心角度数的最大公约数求出正多边形的中心角度数t，已知组成正多边形的三角形面积为$S_{\Delta }=\frac{R^2\sin t}{2}$​，而这样的三角形有$\frac{2\pi }{t}$个，于是正多边形面积为$\frac{\pi R^2\sin t}{t}$.
math部分转自Loner_Knowledge

代码

#include <cmath>
#include <cstdio>
#define R register int 
using namespace std;
const double pi=acos(-1.0);
const double EPS=1e-2;
double x[4], y[4];

double gcd(double a, double b){
	if(fabs(b)<EPS)	return a;
	if(fabs(a)<EPS) return b;
	return gcd(b, fmod(a, b));
}

int main (){
	double a, b, c, p, S, A, B, C, T, D, r;
	
	for (R i=1;i<=3;++i) scanf ("%lf%lf", &x[i], &y[i]);	
	a=sqrt((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2]));
	b=sqrt((x[3]-x[1])*(x[3]-x[1])+(y[3]-y[1])*(y[3]-y[1]));
	c=sqrt((x[2]-x[3])*(x[2]-x[3])+(y[2]-y[3])*(y[2]-y[3]));
	p=(a+b+c)/2;
	S=sqrt(p*(p-a)*(p-b)*(p-c));
	r=(a*b*c)/(4*S);
	A=acos(1-(a*a)/(2*r*r));
	B=acos(1-(b*b)/(2*r*r));
	C=2*pi-A-B;
	T=gcd(A, gcd(B, C));
	printf("%.6lf\n", (pi*r*r*sin(T))/T);
	
	return 0;
}