Ancient Berland Circus(CF 1 C 浮点数GCD)

题目链接
题目大意：
给定正x边形的三个顶点坐标，判断出其最小面积取值时是几边形，并求出他的面积。
知识背景：
1.浮点数取模
2.硬算
3.海伦公式：

p = (a+b+c)/2
4.三角形外接圆半径：

5.正x边形面积计算公式：

6. 圆周角定理：一段弧的圆周角等于圆心角的一半。
先mark浮点数取模的两种方法：

//法一：
double fgcd(double x, double y){
	while(fabs(x)>eps && fabs(y)>eps){
		if(x>y) x-= floor(x/y)*y;
		else y-=floor(y/x)*x;
	}
	return x+y;
}

//法二：
const double ERR = 0.0001;

bool feq (double a, double b)
{
    return fabs(a-b) < ERR;
}

double fgcd(double a, double b)
{
    if (feq(a, 0))
        return b;
    if (feq(b, 0))
        return a;
    return fgcd(b, fmod(a, b));
}

给出暴力代码：

#include <bits/stdc++.h>
#define pi (atan(1.0)*4)
#define eps 1e-4

using namespace std;

struct Point{
	double x, y;
	Point(){}
	Point(double x, double y):x(x), y(y){}
	void input(){scanf("%lf%lf", &x, &y);}
	Point operator -(Point b){return Point(x-b.x, y-b.y);}
	Point operator *(double k){return Point(x*k, y*k);}
	double operator ^(Point b){return x*b.y-y*b.x;}
	double rad(Point a,Point b){
        Point p = *this;
        return fabs(atan2( fabs((a-p)^(b-p)),(a-p)*(b-p) ));
    }
    double dis(Point b){
    	return sqrt((x-b.x)*(x-b.x)+(y-b.y)*(y-b.y));
    }
};

const double ERR = 0.0001;

bool feq (double a, double b)
{
    return fabs(a-b) < ERR;
}

double fgcd(double a, double b)
{
    if (feq(a, 0))
        return b;
    if (feq(b, 0))
        return a;
    return fgcd(b, fmod(a, b));
}

void run_case(){
	Point a, b, c, r;
	a.input(), b.input(), c.input();
	r.x = ((b.y-a.y)*(c.y*c.y-b.y*b.y+c.x*c.x-b.x*b.x)-(c.y-b.y)*(b.y*b.y-a.y*a.y+b.x*b.x-a.x*a.x))/2./((a.x-b.x)*(c.y-b.y)-(b.x-c.x)*(b.y-a.y));
	r.y = (a.x-b.x)/(b.y-a.y)*r.x+(a.y+b.y)/2.-(a.x+b.x)/2.*(a.x-b.x)/(b.y-a.y);
	double ag1 = r.rad(a, b), ag2 = r.rad(a, c);
	double gd = fgcd(ag1, fgcd(ag2, pi*2-ag1-ag2));
	int n = round(pi*2/gd);
	double R = a.dis(r);
	printf("%.6lf\n", n*R*R*sin(pi*2/n)/2.);
	/*这个地方如果头铁带sin(gd)就会在不知名样例出现小数点后六位误差，
	 但是用360/每条边对应的圆心角就把角度误差避免了....
	 别问我怎么知道的qaqq
	 */
}

int main()
{
	int _ = 1;
    while(_ --){
		run_case();
    }
}

附上队长代码orz

#include <bits/stdc++.h>
using namespace std;
static const double EPS=1e-4;
static const double PI=acos(-1.0);
struct Point{
    double x,y;
}point[4];
double dis[4];
double gcd(double x,double y)
{
    while(fabs(x)>EPS && fabs(y)>EPS)
    {
        if(x>y) x-=floor(x/y)*y;
        else y-=floor(y/x)*x;
    }
    return x+y;
}
int main()
{
    for(int i=1;i<=3;i++)
        cin>>point[i].x>>point[i].y;
    dis[1]=sqrt((point[1].x-point[2].x)*(point[1].x-point[2].x)+(point[1].y-point[2].y)*(point[1].y-point[2].y));
    dis[2]=sqrt((point[1].x-point[3].x)*(point[1].x-point[3].x)+(point[1].y-point[3].y)*(point[1].y-point[3].y));
    dis[3]=sqrt((point[2].x-point[3].x)*(point[2].x-point[3].x)+(point[2].y-point[3].y)*(point[2].y-point[3].y));
    Point v1={point[2].x-point[1].x,point[2].y-point[1].y},v2={point[3].x-point[1].x,point[3].y-point[1].y};
    double s=(v1.x*v2.y-v1.y*v2.x)/2;
    double r=dis[1]*dis[2]*dis[3]/4/s;
    double a=acos((dis[2]*dis[2]+dis[3]*dis[3]-dis[1]*dis[1])/(2*dis[2]*dis[3]));
    double b=acos((dis[1]*dis[1]+dis[3]*dis[3]-dis[2]*dis[2])/(2*dis[1]*dis[3]));
    double c=acos((dis[1]*dis[1]+dis[2]*dis[2]-dis[3]*dis[3])/(2*dis[1]*dis[2]));
    double n=PI/gcd(gcd(a,b),c);
    cout<<fixed<<setprecision(8)<<n/2*r*r*sin(2*PI/n)<<endl;
    return 0;
}
————————————————
版权声明：本文为CSDN博主「invoKer-」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/inv00ker/article/details/101436870