light oj 1062 二分
来源:互联网 发布:pony 知乎 编辑:程序博客网 时间:2024/06/13 12:40
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
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<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;}
- light oj 1062 二分
- Light OJ-----1138二分
- light oj 1138 - Trailing Zeroes (III)《《二分》》
- Light OJ 1180 Software Company (二分+DP)
- Light oj Trailing Zeroes (III) (二分查找)
- 【Light-oj】-Expanding Rods(二分&几何)
- LIGHT OJ 1307 - Counting Triangles【二分枚举】
- 【light-oj】-’1307 - Counting Triangles(二分)
- Light OJ 1088 Points in Segments-二分(水)
- Light oj 1180 - Software Company(二分+背包)
- Light OJ 1297 - Largest Box 【求导或二分】
- Light OJ 1105 Fi Binary Number(二分+数位DP)
- Light OJ:1138 Trailing Zeroes (III)(二分)
- Light oj-1138 Trailing Zeroes (III) (二分&数学)
- Light OJ:1137 Expanding Rods(二分+几何数学)
- light oj 1149 - Factors and Multiples (二分匹配)
- 【Light-oj】-1138 - Trailing Zeroes (III)(二分,数学)
- Light OJ 1138 (二分查找+分解阶乘)
- 160726学习总结
- Java同步锁
- spring整合hibernate扫描多个不同包下的实体类
- JMS 消息机制
- Java finally语句到底是在return之前还是之后执行?
- light oj 1062 二分
- HDU 5738-计算几何-统计共线的子集个数
- sqlite数据库多条记录操作效率问题
- iOS相册中如何删除照片
- android----Spinner下拉列表控件
- Nginx入门指导
- 匈牙利算法求二分图的最大匹配/匈牙利算法模板
- java过滤敏感词实现字符串替换功能
- 施工中 ToLua学习笔记(十一) Example 11 Delegate