3835. 计算三角形的周长
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
在平面直角坐标系中,给出三角形三个顶点的坐标,求三角形的周长.
Input
第一行是一个整数T,表示总共有T组数据.
接下来的T行,每行有6个实数x1, y1, x2, y2, x3, y3,表示三角形三个顶点的坐标.
Output
每行输出一个三角形的周长,小数点后保留5位数字.
Sample Input
2
0 0 0 3 4 0
1.2 5.5 -1.0 -4.7 3.2 -0.8
Sample Output
12.00000
22.77589
Problem Source
林瀚
// Problem#: 3835
// Submission#: 1984665
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
int n,x;
cin>>n;
float x1, y1, x2, y2, x3, y3,l;
for(x=0;x<n;x++){
cin>>x1>>y1>>x2>>y2>>x3>>y3;
l=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))+sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3))+sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));
printf("%.5f\n",l);
}
return 0;
}