#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std; const double eps=1e-;
double n,c,l; int main()
{
while(scanf("%lf%lf%lf",&l,&n,&c)&&l!=-&&n!=-&&c!=-){
double s=(+n*c)*l;
double low=,high=0.5*l,mid;
while(high-low>eps)
{
mid=(high+low)/;
double r=(*mid*mid+l*l)/(*mid);
double ss=*r*asin(l/(*r));
if(ss<s)
low=mid;
else
high=mid;
}
printf("%.3lf\n",mid);
}
return ;
}
相关文章
- 03-26Expanding Rods(二分+计算几何)
- 03-262020 BIT冬训-二分三分快速幂矩阵 A - Expanding Rods POJ - 1905
- 03-26# Expanding Rods//POJ - 1905//二分
- 03-26POJ1905-Expanding Rods-二分答案
- 03-26POJ 1905 Expanding Rods 二分答案几何
- 03-26LightOj1137 - Expanding Rods(二分+数学)
- 03-26poj 1905 Expanding Rods (数学 计算方法 二分)
- 03-26POJ - 1905 Expanding Rods(二分+计算几何)
- 03-26poj 1905 Expanding Rods(木杆的膨胀)【数学计算+二分枚举】
- 03-26【二分答案】Expanding Rods POJ 1905