Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1878 Accepted Submission(s): 606
2 2 2 2 2 2
0.9428
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> #include<algorithm> using namespace std; int main() { double l,n,a,m,b,c; double x,y; while(scanf("%lf%lf%lf%lf%lf%lf",&l,&n,&a,&m,&b,&c)!=EOF) { x=4*a*a*b*b*c*c-a*a*(b*b+c*c-m*m)*(b*b+c*c-m*m)-b*b*(c*c+a*a-n*n)*(c*c+a*a-n*n); y=c*c*(a*a+b*b-l*l)*(a*a+b*b-l*l)-(a*a+b*b-l*l)*(b*b+c*c-m*m)*(c*c+a*a-n*n); printf("%.4lf\n",sqrt(x-y)/12); } return 0; }