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.
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 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.
0.000000 0.000000 1.000000 1.000000 0.000000 1.000000
1.00000000 知道三点坐标,然后求该三点组成的最小正多边形。先求组成三角形的外接圆的半径。外接圆半径=四分之一乘a*b*c;然后求出三边对应的圆心角的最大公约数,就是几边形。 源代码: #include<cstdio> #include <iostream> #include <cstring> #include <math.h> #include <algorithm> using namespace std ; #define PI acos(-1) #define eqs 0.01 double gcd(double a,double b) { return a < eqs ? b : gcd(fmod(b,a),a); } int main() { double x1 , y1 , x2 , y2 , x3 , y3 ; double a , b , c , p , s , r , k ; double A , B , C ; cin>>x1>>y1>>x2>>y2>>x3>>y3; a = sqrt( (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) ) ; b = sqrt( (x2-x3)*(x2-x3) + (y2-y3)*(y2-y3) ) ; c = sqrt( (x1-x3)*(x1-x3) + (y1-y3)*(y1-y3) ) ; p = ( a + b + c ) / 2.0 ; s = sqrt( p * (p-a) * (p-b) * (p-c) ) ;//s 代表面积,a,b,c代表边长 r = a * b * c / ( 4 * s ) ;//外接圆半径等于四分之一成变长的乘积 if( a > c ) { k = a ; a = c ; c = k ; } if( b > c ) { k = b ; b = c ; c = k ; } A = 2 * asin(a/(2*r)) ; B = 2 * asin(b/(2*r)) ; C = 2 * PI - A - B ; p = gcd(A,B); p = gcd(p,C) ; printf("%.6lf\n", (PI*r*r*sin(p))/p ) ; return 0; }