提示: 欢迎访问OurACM平台。
Problem 1830 Cut Pyramid

Accept: 47    Submit: 104
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

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

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

Output

For each test case, your program should output the length of AG hold 2 digits after the decimal point. If the answer is absent, output “Oh, my god!”.

Sample Input

1000 500 1000 200

Sample Output

500.00 Oh, my god!

Source

Multi-School Training Contest - FOJ Site #12

Submit  Back  Status  Discuss