文章详情

  • 游戏榜单
  • 软件榜单
关闭导航
热搜榜
热门下载
热门标签
php爱好者> php文档>ZOJ Problem Set - 1090 The Circumference of the Circle

ZOJ Problem Set - 1090 The Circumference of the Circle

时间:2011-03-10  来源:Martin Mar

The Circumference of the Circle

Time Limit: 1 Second      Memory Limit: 32768 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 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 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

Source: University of Ulm Local Contest 1996

  1: #include <iostream>
  2: #include <iomanip>
  3: #include <cmath>
  4: using namespace std;
  5: 
  6: int main(){
  7:     double x0,y0;;
  8:     double x1,y1;
  9:     double x2,y2;
 10:     double  a,
 11:             b,
 12:             c,
 13:             cosA,
 14:             sinA,
 15:             cir,
 16:             r2;
 17:     while(cin>>x0>>y0>>x1>>y1>>x2>>y2){
 18:         
 19:         a = sqrt((x0 - x1)*(x0 - x1) + (y0 - y1)*(y0 - y1));//a 边长度
 20:         b = sqrt((x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1));//b 边长度
 21:         c = sqrt((x2 - x0)*(x2 - x0) + (y2 - y0)*(y2 - y0));//c 边长度
 22:         cosA = (b*b + c*c - a*a)/(2*b*c);//余弦定理
 23:         sinA = sqrt(1 - cosA*cosA);
 24:         r2 = a/sinA;//正弦定理,r2为三角形外接圆直径
 25:         cir = 3.141592653589793 * r2;
 26:         cout<<fixed<<setprecision(2)<<cir<<endl;
 27:     }
 28: }
相关阅读 更多 +
排行榜 更多 +
别惹神枪手安卓版

别惹神枪手安卓版

冒险解谜 下载
坦克战争世界

坦克战争世界

模拟经营 下载
丛林反击战

丛林反击战

飞行射击 下载