二分搜索
来源:互联网 发布:剑三明教正太捏脸数据 编辑:程序博客网 时间:2024/06/07 02:37
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. Ay 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 exactlyc feet from the ground. How wide is the street?
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 ofx,y, andc.
For each case, output the case number and the width of the street in feet. Errors less than10-6 will be ignored.
4
30 40 10
12.619429 8.163332 3
10 10 3
10 10 1
Case 1: 26.0328775442
Case 2: 6.99999923
Case 3: 8
Case 4: 9.797958971
学会构造表达式,输入在其左端,结果在右端需为定值(代码中与mid比较的 1 便是定值)
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
double c,y,x,a;
double f(double a)
{
return c/sqrt(y*y-a*a)+c/sqrt(x*x-a*a);
}
int main()
{
int t,p=0;
scanf("%d",&t);
while(t--)
{
scanf("%lf %lf %lf",&x,&y,&c);
double left=0.0,right=min(x,y),mid,k;//学会使用c++,min函数可以直接调用
while(right-left>=0.0000000001)//精度
{
mid=(left+right)/2;
if(f(mid)==1)
{
break;
}
else if(f(mid)>1)
{
right=mid;//right=mid-0.0000001;
}
else
left=mid;//left=mid+0.0000001;
}
printf("Case %d: %lf\n",++p,mid);
}
return 0;
}
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 二分搜索
- 算法 最小M段和问题
- 打造强大的Python开发环境--vim
- Java正则表达式之截取字符串
- Composer笔记(二):建立自己的PHP类库
- 文章标题
- 二分搜索
- Codeforces 452F
- 深入理解计算机各种类型大小(sizeof)
- web前端
- libjpeg 库的安装
- php 数组 类对象 值传递 引用传递 区别
- PhpStorm支持CI框架的代码提示自动补全(自己写的model类和Service类及类里的function的自动提示)(详细步骤)
- mysql5.5.49多实例安装
- Andriod资料库