zoukankan      html  css  js  c++  java
  • HDU 2289 Cup

    Cup

    Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 7077    Accepted Submission(s): 2177


    Problem Description
    The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?

    The radius of the cup's top and bottom circle is known, the cup's height is also known.
     
    Input
    The input consists of several test cases. The first line of input contains an integer T, indicating the num of test cases.
    Each test case is on a single line, and it consists of four floating point numbers: r, R, H, V, representing the bottom radius, the top radius, the height and the volume of the hot water.

    Technical Specification

    1. T ≤ 20.
    2. 1 ≤ r, R, H ≤ 100; 0 ≤ V ≤ 1000,000,000.
    3. r ≤ R.
    4. r, R, H, V are separated by ONE whitespace.
    5. There is NO empty line between two neighboring cases.

     
    Output
    For each test case, output the height of hot water on a single line. Please round it to six fractional digits.
     
    Sample Input
    1 100 100 100 3141562
     
    Sample Output
    99.999024
     
    Source
     
     
     
    解析:二分。
     
     
     
     1 #include <cstdio>
     2 #include <cmath>
     3 
     4 const double PI = acos(-1.0);
     5 int T;
     6 double r,R,H,V;
     7 
     8 int main()
     9 {
    10     scanf("%d", &T);
    11     while(T--){
    12         scanf("%lf%lf%lf%lf", &r, &R, &H, &V);
    13         double low = 0, high = H;
    14         double mid;
    15         while(high-low>1e-8){
    16             mid = (low+high)/2;
    17             double mid_r = mid/H*(R-r)+r;
    18             double mid_v = PI/3*mid*(r*r+r*mid_r+mid_r*mid_r);
    19             if(mid_v<V)
    20                 low = mid+1e-8;
    21             else
    22                 high = mid-1e-8;
    23         }
    24         mid = (low+high)/2;
    25         printf("%.6f
    ", mid);
    26     }
    27     return 0;
    28 }
  • 相关阅读:
    星空雅梦
    星空雅梦
    星空雅梦
    星空雅梦
    深入理解Java虚拟机:JVM高级特性与最佳实践(第3版)请自取
    Map遍历法则
    c.toArray might (incorrectly) not return Object[]
    JavaGuide
    NIO入门
    Docker应用安装
  • 原文地址:https://www.cnblogs.com/inmoonlight/p/5553772.html
Copyright © 2011-2022 走看看