HDOJ 1374 The Circumference of the Circle （求外接圆）

The Circumference of the Circle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 924    Accepted Submission(s): 689

Problem 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. 

 

Input

The input file 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
  
  

 

分析：已知三个点的坐标，求出外接圆圆心坐标，再求出半径，最后求出周长

#include <cstdio>
#include <cmath>
using namespace std;

const double PI = 3.141592653589793;
struct point
{
    double x, y;
}p[5];
double dis(point a , point b)
{
     return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));
}
point Interesection(point u1,point u2,point v1,point v2)
{
         point ans = u1;
    double t = ((u1.x - v1.x) * (v1.y - v2.y) - (u1.y - v1.y) * (v1.x - v2.x)) /
               ((u1.x - u2.x) * (v1.y - v2.y) - (u1.y - u2.y) * (v1.x - v2.x));
    ans.x += (u2.x - u1.x) * t;
    ans.y += (u2.y - u1.y) * t;
    return ans;    //高精度求线段交点，即为外接圆的圆心。
}
point Circum(point a , point b , point c)
{
     point ua,ub,va,vb;           //求出两条中垂线段
    ua.x = ( a.x + b.x ) / 2;
    ua.y = ( a.y + b.y ) / 2;
    ub.x = ua.x - a.y + b.y;
    ub.y = ua.y + a.x - b.x;
    va.x = ( a.x + c.x ) / 2;
    va.y = ( a.y + c.y ) / 2;
    vb.x = va.x - a.y + c.y;
    vb.y = va.y + a.x - c.x;
      return Interesection(ua,ub,va,vb);
}
int main()
{
    while (scanf("%lf%lf%lf%lf%lf%lf", &p[0].x, &p[0].y, &p[1].x, &p[1].y, &p[2].x, &p[2].y) != EOF){
        point o = Circum(p[0], p[1], p[2]);
        double r = dis(p[0], o);
        printf("%.2lf\n", 2 * PI * r);
    }
    return 0;
}