HDU 影子问题

时间：2014-03-09 00:55:50 阅读：580 评论：0 收藏：0 [点我收藏+]

Problem Description

Compared to wildleopard‘s wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to earn more money. One day, he found that the length of his shadow was changing from time to time while walking between the light bulb and the wall of his house. A sudden thought ran through his mind and he wanted to know the maximum length of his shadow.

Input

The first line of the input contains an integer T (T <= 100), indicating the number of cases.

Each test case contains three real numbers H, h and D in one line. H is the height of the light bulb while h is the height of mildleopard. D is distance between the light bulb and the wall. All numbers are in range from 10^-2 to 10³, both inclusive, and H - h >= 10^-2.

Output

For each test case, output the maximum length of mildleopard‘s shadow in one line, accurate up to three decimal places..

Sample Input

Sample Output

1.000
0.750
4.000

我感觉这就是一道数学题：

#include<stdio.h>

#include<math.h>
int main()
{
int n;
double H,D,h,s1,s2,x1,x2,i,s;
scanf("%d",&n);
while(n--)
{
scanf("%lf%lf%lf",&H,&h,&D);
s1=D*h/H;
x1=D*(H-h)/H;
x2=sqrt(D*(H-h));
s2=(-x2*x2+x2*(D+H)+D*(h-H))/x2;
if(x2<=x1)
s=s1;
if(x2>=D)
{
if(s1>=h)
s=s1;
else
s=h;
}
if(x2<D && x2>x1)
{
if(s1>=s2)
s=s1;
else
s=s2;
}

printf("%.3f\n",s);
}
return 0;
}

HDU 影子问题,布布扣,bubuko.com

HDU 影子问题

原文：http://blog.csdn.net/u013712847/article/details/20805129

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)