POJ-2242 The Circumference of the Circle-已知三点共圆求周长
来源:互联网 发布:linux wexitstatus 编辑:程序博客网 时间:2024/05/21 14:44
The Circumference of the Circle
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7850 Accepted: 4768
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.
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 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.50.0 0.0 0.0 1.0 1.0 1.05.0 5.0 5.0 7.0 4.0 6.00.0 0.0 -1.0 7.0 7.0 7.050.0 50.0 50.0 70.0 40.0 60.00.0 0.0 10.0 0.0 20.0 1.00.0 -500000.0 500000.0 0.0 0.0 500000.0
Sample Output
3.144.446.2831.4262.83632.243141592.65
Source
Ulm Local 1996
//利用已知三角形三边求其面积的公式和正弦定理求得圆的直径#include <iostream>#include <cstring>#include <iomanip>#include <stdio.h>#include <cmath>const double PI=acos(-1.0);using namespace std;int main(){ double x1,y1,x2,y2,x3,y3,a,b,c,s,p,d; while(cin>>x1>>y1>>x2>>y2>>x3>>y3) { a=sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2)); b=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3)); c=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); p=(a+b+c)/2; s=sqrt(p*(p-a)*(p-b)*(p-c)); d=a*b*c/(2*s); cout<<setiosflags(ios::fixed)<<setprecision(2)<<d*PI<<endl; } return 0;}
0 0
- POJ-2242 The Circumference of the Circle-已知三点共圆求周长
- POJ 2242 The Circumference of the Circle
- poj 2242 The Circumference of the Circle
- POJ 2242 - The Circumference of the Circle
- POJ 2242 The Circumference of the Circle
- poj 2242 The Circumference of the Circle
- zoj 1090 || poj 2242 The Circumference of the Circle
- POJ 2242 The Circumference of the Circle (计算几何)
- poj--2242--The Circumference of the Circle&&[NYIST 1142&&ZOJ1090]
- POJ 2242 The Circumference of the Circle 简单数学
- POJ 2242|ZOJ 1090 The Circumference of the Circle
- POJ 2242 The Circumference of the Circle 笔记
- (DS1.5.6)POJ 2242 The Circumference of the Circle(一直三个点的坐标,求外接圆的周长)
- 2242 The Circumference of the Circle
- POJ2242_The Circumference of the Circle(几何/三角形外接圆周长/模板)
- The Circumference of the Circle
- pku2242The Circumference of the Circle
- zoj1090 The Circumference of the Circle
- A. GukiZ and Contest-Codeforces Round #307 (Div. 2)-简单水题
- 【CF245H】【Queries for Number of Palindromes】
- android 设置全屏,窗口透明度,待机设置,主题设置总结
- Objective-C文章中的生词
- hdu 5340 Three Palindromes
- POJ-2242 The Circumference of the Circle-已知三点共圆求周长
- C++(14)STL分析与实践之容器适配器
- Codeforces Round #274 (Div. 2)E. Riding in a Lift
- JS闭包与内存泄漏
- 在数组中需找连续“1”的起始位置和结束位置
- POJ-2739 Sum of Consecutive Prime Numbers-求一个数满足有多少组递增相加的素数等于该数
- ACdream1734 Can you make a water problem?(贪心)
- iOS8的UITextView问题
- HDU-1686-Oulipo