新一篇: JOJ ACM 1061 | 旧一篇: JOJ ACM 1149

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

3.14
4.44
6.28
31.42
62.83
632.24
3141592.65

code:

#include<stdio.h>
#include<math.h>

struct Point
{
	double x;
	double y;
}a[3];

double SinA()
{
  double dist,high;
  double A,B,C;
  A = a[0].y-a[1].y;
  B = a[1].x-a[0].x;
  C = a[0].x*a[1].y-a[1].x*a[0].y;
  high = fabs(A*a[2].x+B*a[2].y+C)/sqrt(A*A+B*B);
  dist = sqrt(pow((a[0].x - a[2].x),2)+pow(a[0].y-a[2].y,2));
  return high/dist;
}
int main()
{
         double c,ab;
	while(scanf("%lf%lf%lf%lf%lf%lf",&a[0].x,&a[0].y,&a[1].x,&a[1].y,&a[2].x,&a[2].y)!=EOF)
	{
	  ab = sqrt(pow((a[1].x - a[2].x),2)+pow(a[1].y-a[2].y,2));
           c = ab * 3.141592653589793 / SinA();
	  printf("%.2lf\n",c);
	}
	return 0;
}

发表于 @ 2006年01月17日 19:26:00|评论(loading...)|编辑

新一篇: JOJ ACM 1061 | 旧一篇: JOJ ACM 1149