HDUOJ3201 Build a Fence

Build a Fence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 676    Accepted Submission(s): 521


Problem Description

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.
 

 

Sample Input
1 100 0
 

 

Sample Output
0.16 1591.55
 
 
View Code
#include<stdio.h>
#define pi 3.1415926
int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
       printf("%.2lf\n",pi*(n/pi)*(n/pi)/2);
    }
return 0;
}

 

转载于:https://www.cnblogs.com/zhaojiedi/archive/2012/07/27/2613428.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值