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
|
narutohokage_1:
2016-09-07 17:42:29
Thanks @rpc1 For such a clear description. |
|
baadshah_:
2016-06-22 08:54:33
trick printf("%.2f\n",ans); |
|
CounterNormalize:
2016-01-11 02:30:41
for those getting WA in C++
|
|
rpc1:
2015-05-19 20:18:47
Imagine a very long straight ruler and a piece of smallish rope. The rope is tied to the ruler at one end and loose at the other. Now connect the other end of the rope to the ruler and you'd get a shape with a straight bottom (made of the ruler itself) and a curvy top (made by the rope). This shape has an area, what is its maximum area given the length of the rope? |
| Added by: | Fudan University Problem Setters |
| Date: | 2009-05-23 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: C99 ERL JS-RHINO NODEJS PERL6 VB.NET |
| Resource: | Fudan University Local Contest #1, practise session |
RSS