HNUOJ_10081

Crossed ladders

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 374, Accepted users: 331

Problem 10081 : No special judgement

Problem 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

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

Output

For each line of input, output one line with a floating point number giving the width of the street in feet, with three decimal digits in the fraction.

Sample Input

30 40 10 12.619429 8.163332 3 10 10 3 10 10 1

Sample Output

26.033 7.000 8.000 9.798

解题思路

几何问题，建立几何关系

然后递归（二分法）求出中间值

h1 = sqrt(x*x-d*d);

h2 = sqrt(y*y-d*d);

(h1-c)/h1 = d1/d = c/h2

c = (h1*h2)/(h1+h2);

通过二分法（逼近的思想）找到d即可

代码：

#include
#include
#include
#define A 1e-5
//#define A 0.0000001
using namespace std;
double x,y,c;
double f(double d)
{
	double h1,h2;
	double z;
	h1=sqrt(x*x-d*d);
	h2=sqrt(y*y-d*d);
	z=((h1*h2)/(h1+h2))-c;
	return z;
}
int main()
{
	while(scanf("%lf%lf%lf",&x,&y,&c)==3)
	{
	    //scanf("%lf%lf%lf",&x,&y,&c);
		double up=0,mid=0,down=0;//好坑啊，必须赋初值为0，否则无法AC 
		 xA)
		 {
		 	mid=(up+down)/2.0;
		 	if(f(mid)>0)
		 	{
		 		down=mid;
		 	}
		 	else
		 	{
		 		up=mid;
		 	}
		 }
		 printf("%0.3f\n",mid);
	}
	return 0;
}

还有一个代码：

#include
#include
#include
#include
#include
#include
#include
#include
#include