您的位置:首页 > 其它

poj_2242

2015-12-13 20:13 169 查看
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
using namespace std;
#define clc(s,t) memset(s,t,sizeof(s))
#define PI 3.141592653589793
double dis(double a,double b,double c,double d){
return sqrt((c-a)*(c-a)+(d-b)*(d-b));
}
int main(){
double a,b,c,d,e,f;
while(scanf("%lf %lf %lf %lf %lf %lf",&a,&b,&c,&d,&e,&f)!=EOF){
double s = fabs(a*d+b*e+c*f-d*e-a*f-b*c);
printf("%.2f\n",PI*dis(a,b,c,d)*dis(a,b,e,f)*dis(c,d,e,f)/s);
}
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: