#include<stdio.h>
#include<math.h>
int main()
{
int T,d,i,j;
double H,h,D,l,sum,min,x;
scanf("%d",&T);
while(T--){
scanf("%lf%lf%lf",&H,&h,&D);
// printf("D-i=%lf D=%lf H=%lf h=%lf\n",D*h/H,D,H,h);
D=D*100;
h=h*100;
H=H*100;
d=D-D*h/H;
min=-1.0;
printf("d=%d D-i=%lf D=%lf H=%lf h=%lf\n",d,D*h/H,D,H,h);
for(i=d;i<=D;i++){
x=fabs((h*D-H*i)/(H-h));
sum=D-i+(H*x)/(D+x);
// printf("x=%lf %lf\n",x,(H*x)/(D+x));
if(min<sum){
min=sum;
}
}
min/=100;
printf("%.3lf\n",min);
}
return 0;
}
最长影子问题(第六届第二题) (2011-3-15 21:41)
最新推荐文章于 2020-05-04 18:23:13 发布