zoukankan      html  css  js  c++  java
  • Crossed Ladders

    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 xy, 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
    ",cut,ans);
    	  }	
    	return 0;
    }


  • 相关阅读:
    $router和$route的区别
    提莫攻击
    paste命令
    数组中的第K个最大元素
    od命令
    被围绕的区域
    不用虚机不用Docker使用Azure应用服务部署ASP.NET Core程序
    面试官:对象可能会迟到,但它永远不会缺席
    Kubernetes 的层级命名空间介绍
    每日一道 LeetCode (21):对称二叉树
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027125.html
Copyright © 2011-2022 走看看