Coin Question
Source : ACM Group | |||
Time limit : 1 sec | Memory limit : 64 M |
Submitted : 360, Accepted : 194
Every HCPC(HIT Collegiate Programming Contest), Participants will check if Robin has set a problem. The reason is so obvious -- he has been so weak, how hard can his problem be.
This year, tradition goes on. You can solve this problem within one minute, or two minutes at most.
Here is the problem. Robin has a round table with radius R (0.00 <= R <= 100000000.00), and a lot of same coins (you can assume they are infinite) with radius r (0.00 <= r <= 10000.00). Robin invites two friends, Mr. Wendy and Mr. Pian, to play a game. Rules are as follows.
1. Mr. Wendy and Mr. Pian take turns to place one coin on the table. Mr. Wendy first.
2. One can place the coin anywhere on the table, but he can't place it on any other coins, even one corner is not allowed.
3. One can't let the coin which he places hang in the air, which means any part of the coin must be close to the table's surface.
4. The person who can't place a coin on the table loses the game.
Input
The input data are of various cases.Each case consists of two float numbers. Round table's radius R and the coin's radius r.The input ends with EOF.
Output
For each case, If Mr. Wendy wins the game, you should output a line:
Yes, Mr. Wendy is a ****ing genius!
Or, you should output the line:
No, Mr. Pian is the real ****ing genius!
Sample Input
4.00 4.00 4.00 5.00
Sample Output
Yes, Mr. Wendy is a ****ing genius! No, Mr. Pian is the real ****ing genius!