Best Coder ^beta
VIP | STD Contests
DIY | Web-DIY ^beta

Cut Pyramid

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 437 Accepted Submission(s): 171

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

2009 Multi-University Training Contest 12 - Host by FZU

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-04-19 22:40:19, Gzip enabled

Administration