问题描述 :
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.
输入:
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.
输出:
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.
样例输入:
11000
样例输出:
0.161591.55
