Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6952 | Accepted: 4334 |
Description
To calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't?
You are given the cartesian coordinates of three non-collinear points in the plane.
Your job is to calculate the circumference of the unique circle that intersects all three points.
You are given the cartesian coordinates of three non-collinear points in the plane.
Your job is to calculate the circumference of the unique circle that intersects all three points.
Input
The input will contain one or more test cases. Each test case consists of one line containing six real numbers x1,y1, x2,y2,x3,y3, representing the coordinates of the three points. The diameter of the circle determined by the three points will never exceed a million. Input is terminated by end of file.
Output
For each test case, print one line containing one real number telling the circumference of the circle determined by the three points. The circumference is to be printed accurately rounded to two decimals. The value of pi is approximately 3.141592653589793.
Sample Input
0.0 -0.5 0.5 0.0 0.0 0.5 0.0 0.0 0.0 1.0 1.0 1.0 5.0 5.0 5.0 7.0 4.0 6.0 0.0 0.0 -1.0 7.0 7.0 7.0 50.0 50.0 50.0 70.0 40.0 60.0 0.0 0.0 10.0 0.0 20.0 1.0 0.0 -500000.0 500000.0 0.0 0.0 500000.0
Sample Output
3.14 4.44 6.28 31.42 62.83 632.24 3141592.65
Source
//感觉略奇葩,答案输出应该是没有问题的,但是持续WA很奇怪。
//神奇的海伦公式 S=sqrt(p*(p-a)*(p-b)*(p-c)) 数学是多么重要的工具啊,同志们
#include<iostream>
#include<cstdio>
#include<cmath>
#define Pi 3.141592653589793
using namespace std;
int main()
{
double x1,x2,x3,y1,y2,y3;
double l1,l2,l3;
double p,h,d;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3)
{
l1=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
l2=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));
l3=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
p=(l1+l2+l3)/2;
h=sqrt(p*(p-l1)*(p-l2)*(p-l3))*2/l3;
d=l1*l2/h;
printf("%.2lf\n",Pi*d);
}
return 0;
}