三分

   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 103, 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

3
2 1 0.5
2 0.5 3
4 3 4

Sample Output

1.000
0.750
4.000

 题目大意：对于给定的H,h,D,求一个人留在地上的影子和墙上的影子之和的最大值。根据给出的这个图我们可以求出，

当这个人离墙边的距离为x时的地上的影子和墙上的影子之和。显然，地上的影子就是x,那么墙上的影子长度是什么呢？

我们可以根据中学的相似三角形求得，具体如下：

 

注意r与l的初始赋值。

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
double H,h,D;
double f(double x){
	return (h*D-H*x)/(D-x)+x;
}
int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>H>>h>>D;
		double m,mm;
		double l=0,r=h/H*D;
		while(r-l>=1e-6){
			m=(l+r)/2;
			mm=(m+r)/2;
			if(f(m)>f(mm)) r=mm;
			else l=m;
 		}
 		printf("%.3lf\n",f(l));
	}
	return 0;
}