hdu 5476

最新推荐文章于 2018-11-28 17:08:26 发布

LeeBooL

最新推荐文章于 2018-11-28 17:08:26 发布

阅读量441

点赞数

分类专栏：计算几何

本文链接：https://blog.csdn.net/u013570474/article/details/48780545

版权

计算几何专栏收录该内容

22 篇文章 0 订阅

订阅专栏

#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<map>
#define pi (2*acos(0))
#define maxn 1000000
using namespace std;

int main()
{
    int t;
    scanf("%d", &t);
    for (int k=1;k<=t;k++)
    {
        double ax, ay, bx, by, cx, cy;
        scanf("%lf%lf%lf%lf%lf%lf", &ax, &ay, &bx, &by, &cx, &cy);
        double t1 = (ax - bx) * (ax - bx) + (ay - by) * (ay - by);
        double ab = sqrt(t1);
        double t2 = (bx - cx) * (bx - cx) + (by - cy) * (by - cy);
        double bc = sqrt(t2);

        double h = sqrt(t1 - t2/4);
        double ang_ABC = acos(bc/(2.0*ab));
        double ang_BAM = pi/2.0 - ang_ABC;
        double r = 1.0/2.0*bc/cos(ang_BAM);
        double d = r*pi*2;
        double ans = 0;
        ans = d*ang_ABC/pi;
        ans = ans + h;
        printf("Case #%d: %.4f\n", k, ans);
    }
    return 0;
}