![]() |
||||||||||
|
||||||||||
Cuts the cakeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4657 Accepted Submission(s): 3022 Problem Description Ice cream took a bronze medal in the Beijing match. Liu sir is very very happy. So he buys a cake for them. kiki is a child who likes eating, so the task of cuting cake was given to kiki. kiki is also a mischievous child. She wants to cut the cake in a different way. This is introduced in the figure below. ![]() But there is a difficult problem.which is how to make each preson get equally many cake. kiki is not good at match, so she wants you help her solve this problem. Input Input contains multiple test cases. Each line is a case. Each case contains only one integer R which is the radius. The input is terminated with a R of 0. Output For each test case, you should printf two numbers r2 and r1 in a line, accurate up to 3 decimal places, separate them by one space. Sample Input
Sample Output
Author ☆RPG♀月野兔☆ Source | ||||||||||
|