coj 1403: 三角形面积

最新推荐文章于 2022-12-28 11:27:30 发布

SHIHAO0711

最新推荐文章于 2022-12-28 11:27:30 发布

阅读量407

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/SHIHAO0711/article/details/47624293

版权

ACM 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

#include<stdio.h>
//1403
#include<math.h>
int main()
{
   double Xa, Ya, Za, Xb, Yb, Zb, Xc, Yc, Zc;
   int T;
   scanf("%d", &T);
   while(T --)
   {
       scanf("%lf%lf%lf", &Xa, &Ya, &Za);
       scanf("%lf%lf%lf", &Xb, &Yb, &Zb);
       scanf("%lf%lf%lf", &Xc, &Yc, &Zc);
       double a, b, c, p;
       a = pow((double)((Xa-Xb)*(Xa-Xb) + (Ya-Yb)*(Ya-Yb) + (Za-Zb)*(Za-Zb)), 0.5);
       b = pow((double)((Xa-Xc)*(Xa-Xc) + (Ya-Yc)*(Ya-Yc) + (Za-Zc)*(Za-Zc)), 0.5);
       c = pow((double)((Xb-Xc)*(Xb-Xc) + (Yb-Yc)*(Yb-Yc)+ (Zb-Zc)*(Zb-Zc)), 0.5);
       p = (a + b + c)/2;
       printf("%lf\n", pow((double)p*(p-a)*(p-b)*(p-c), 0.5));
   }
   return 0;
}