FENCE1  Build a Fence
There is a wall in your backyard. It is so long that you can’t see its endpoints. You want to build a fence of length L such that the area enclosed between the wall and the fence is maximized. The fence can be of arbitrary shape, but only its two endpoints may touch the wall.
Input
The input consists of several test cases.
For every test case, there is only one integer L (1<=L<=100), indicating the length of the fence.
The input ends with L=0.
Output
For each test case, output one line containing the largest area. Your answer should be rounded to 2 digits after the decimal point.
Example
Input: 1 0 Output: 0.16
hide comments
mrigank9:
20170206 20:46:19
AC in one go :) 

nishanth2066:
20170116 16:32:03
Don't use round() in python instead of %.2f 

shantanu_sarin:
20170101 12:51:57
ac in one go......


dhruv19:
20161222 17:21:16
Do not use 22/7 as the value of pi


mohitgupta07:
20161117 18:47:05
My 50th and yeah i got 2 wa just coz i forgot to write \n in cpp ,,nd thats why i hate cpp nd c _


esshuvo:
20161104 07:35:22
can anyone please explain why Length=Radius*PI ? I got the problem statement,And how to do that.But this one is till now confusing to me :) 

coolio_1:
20161101 10:53:45
use pi as 3.14159, float works!!!!


marshal4world:
20161031 17:31:49
typecasting errors can occur ... use everything in double 

sush_75:
20160924 20:07:18
Don't use 22/7 as the value of pi gives WA 

narutohokage_1:
20160907 17:42:29
Thanks @rpc1 For such a clear description. 
Added by:  Fudan University Problem Setters 
Date:  20090523 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Fudan University Local Contest #1, practise session 