当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3201：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.
输入解释
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.
输出解释
For each test case, output one line containing the largest area. Your answer should be rounded to 2 digits after the decimal point.
输入样例 
1
100
0
输出样例 
0.16
1591.55
来自杭电HDUOJ的附加信息
Recommend zhuweicong
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2009 Shanghai Invitation Contest Host by DHU
源链接： HDU-3201
最后修改于 2020-10-25T23:01:08+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)