2014
02-27

# Cut Pyramid

Yaya and maomao have a cake. And the shape of the cake is a pyramid. As the following picture, AB=AC=AD=BC=BD=CD=N. Now they want to cut the cake to two same volume pieces as following picture. And EF is on the plane BCD and parallel to CD. GH is on the plane ACD and parallel to CD, too. Now give you the length of CE=L, and ask you to calculate the length of AG.

Input contains multiple cases each presented on a separate line. Each line contains two integer numbers N(5<=N<=1000),L (0<=L<=N).

Input contains multiple cases each presented on a separate line. Each line contains two integer numbers N(5<=N<=1000),L (0<=L<=N).

1000 500
1000 200

500.00
Oh, my god!

/*

*/

#include<stdio.h>
#include<math.h>
int main()
{
double r,a,b,c,t;
double x1,x2;
while(scanf("%lf%lf",&r,&a)!=EOF)
{
t=-1.0;
b=r-a;
c=r*r*r/a/2-2*r*r+a*r;
if(b*b-4*c<0)
{
printf("Oh, my god!/n");
continue;
}
x1=(-b+sqrt(b*b-4*c))/2;
x2=(-b-sqrt(b*b-4*c))/2;
if(x1>=0&&x1<=r)
t=x1;
else if(x2>=0&&x2<=r)
t=x2;
if(t>=0&&t<=r)
printf("%.2lf/n",t);
else
printf("Oh, my god!/n");
}
return 0;
}