ZOJ Problem Set - 1090——The Circumference of the Circle

ZOJ Problem Set - 1090

The Circumference of the Circle

Time Limit: 2 Seconds Memory Limit: 65536 KB

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.

Input Specification

The input file will contain one or more test cases. Each test case consists of one line containing six real numbers x₁,y₁, x₂,y₂,x₃,y₃, 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 Specification

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

Source: University of Ulm Local Contest 1996

Submit Status

 1 #include<bits/stdc++.h>
 2 #define pi 3.141592653589793
 3 
 4 using namespace std;
 5 
 6 double len(double a,double b,double c,double d)
 7 {
 8     return sqrt((a-b)*(a-b)+(c-d)*(c-d));
 9 }
10 
11 int main()
12 {
13     double x1,x2,x3,y1,y2,y3;
14     while(cin>>x1>>y1>>x2>>y2>>x3>>y3)
15     {
16         //求内接三角形的每一个边 
17         double a=len(x1,x2,y1,y2),b=len(x1,x3,y1,y3),c=len(x2,x3,y2,y3);
18         //求2R=a/sinA 因为不知道sinA 所以先求cosA 那么就是cosA = b^2-c^2/2bc 然后1-cosA的平方=sinA的平方  
19         double cosa=(b*b+c*c-a*a)/(2*b*c);
20         double sina=sqrt(1-cosa*cosa);
21         double d=a/sina;
22         printf("%.2f\n",pi*d);
23     }
24     return 0;
25 }