Crossed Ladders<poj2507题目一样>
2016-07-27 20:36
330 查看
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?
![](http://7xjob4.com1.z0.glb.clouddn.com/a79c38eaf1a80f10eed92879d73a10f5)
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
4
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
求两个房子之间的距离
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
4
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<cstdio> #include<cmath> #define eps 1e-8 int main() { int t; int cut=0; scanf("%d",&t); while(t--) { cut++; double x,y,h; scanf("%lf%lf%lf",&x,&y,&h); int S=100; double l=0.0,r=1000.0; double ans; while(S--) { double mid=(l+r)/2.0; double jiao1=acos(mid/y); double jiao2=acos(mid/x); double L=h/tan(jiao1)+h/tan(jiao2); if(mid>L) { l=mid+eps; ans=mid; } else { r=mid-eps; } } printf("Case %d: %.7lf\n",cut,ans); } return 0; }
相关文章推荐
- eclipse svn插件展示作者、修改日期等label
- c++内联函数(inline)使用详解
- ubunutu16.4 64位安装arm-linux-gcc交叉编译器
- LINUX下安装软件的集中方法
- codeforces 140C New Year Snowmen
- 2016暑假集训7.27 链表 数据结构上机测试1:顺序表的应用
- C# 创建ftp连接的时候报 System.Net.Sockets.SocketException] = {"不知道这样的主机。"}
- 完整java开发中JDBC连接数据库代码和步骤
- jenkins+maven+svn+tomcat之快速部署初探(docker篇)
- hdu2222 ac自动机模版
- diff命令
- HDU 5752 Sqrt Bo
- TortoiseSVN菜单项功能说明
- Leetcode 229. Majority Element II (Medium) (cpp)
- 20145202 《Java程序设计》第四周学习总结
- __bridge的相关使用
- python pandas 将行合并
- UVA 539 The Settlers of Catan
- linux 任务计划
- 新手学Linux命令之history