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.
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.
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.
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
3.14 4.44 6.28 31.42 62.83 632.24 3141592.65
题意:给出三角形坐标,求外接圆的周长,精确到小数点后两位,并给出PI的值,思路根据海伦公式算出三角形面积,再根据s=a*b*c/4r,推到公式:s=absinc/2;(c/cinc)=2r;算出外接圆的半径。
#include<iostream> #include<cstdio> #include<cmath> using namespace std; int main() { double PI=3.141592653589793; double x1,y1,x2,y2,x3,y3,s,r,p,a,b,c,len; while(cin>>x1>>y1>>x2>>y2>>x3>>y3) { a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));//边长 b=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3)); c=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3)); p=(a+b+c)/2; s=sqrt(p*(p-a)*(p-b)*(p-c));//海伦公式 r=(a*b*c)/(4*s);//根据面积算出周长 len=2.0*r*PI; printf("%.2lf\n",len); } }