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
r210397:
20180626 20:54:40
why round is'nt working with python


Piotrek Nicowski:
20180508 15:34:17
I have an awful problem with this task in Java. For those who strugle with this task:


ash_maurya:
20180320 21:56:45
Implementation is easy. The only trick here is in precision. For C++, use fixed setprecision(2). 

kkislay20:
20180310 18:47:51
Implementation is too easy if you get it. 

ayusofayush:
20180217 06:22:05
use pi=3.14159 and use setprecision() in c++ 

shashankpathak:
20180216 21:00:28
i used value of pi=3.1415926 it gave the AC while for 22.00/7.00 it was giving WA why so ?? 

venkat016:
20180110 21:15:56
Thanks to @ajayc1007 and @prasad_235 for the logic 

gokulmit:
20180110 07:31:23
round off using %.2f in c. cout.percision caused a wa 

vkash:
20180101 14:54:49
AC in one Go..just 1 line of code...!! 

mpride44:
20171223 08:39:57

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 