light oj 1062 二分

最新推荐文章于 2020-04-16 18:43:24 发布

※夏日星空※

最新推荐文章于 2020-04-16 18:43:24 发布

阅读量330

点赞数

分类专栏：二分

本文链接：https://blog.csdn.net/qq_34681949/article/details/52038052

版权

二分专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Crossed Ladders

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Submit Status

Description

A narrow street is lined with tall buildings. An x foot long ladder is rested at the base of the building on the right side of the street and leans on the building on the left side. A y foot long ladder is rested at the base of the building on the left side of the street and leans on the building on the right side. The point where the two ladders cross is exactly c feet from the ground. How wide is the street?

Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each test case contains three positive floating point numbers giving the values of x, y, and c.

Output

For each case, output the case number and the width of the street in feet. Errors less than 10^-6 will be ignored.

Sample Input

30 40 10

12.619429 8.163332 3

10 10 3

10 10 1

Sample Output

Case 1: 26.0328775442

Case 2: 6.99999923

Case 3: 8

Case 4: 9.797958971

代码：

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
double MIN(double x,double y)
{
	return x<y?x:y;
}
int main()
{
	double  x,y,c;
	int t,k=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%lf%lf",&x,&y,&c);
		int size=100;
		double l=0,r=MIN(x,y);
		while(size--)
		{
			double mid=(l+r)/2.0;
			double a1=acos(mid/x);
			double a2=acos(mid/y);
			double d=c/tan(a1)+c/tan(a2);
			if(d<mid)
			{
				l=mid;
			}
			else
			{
				r=mid;
			}
		}
		printf("Case %d: %.7lf\n",k++,l);
	}
	return 0;
}