HDU2289(二分法)

Cup

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

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
   
   
   
   
   
   
   
   

    
    
    
     
   
   
   
   
   
   
   
   

    
    
    
    //二分高度逐步逼近
   
   
   
   
   
   
   
   

    
    
    
    
#include<iostream> #include<cstdio> using namespace std; const double MSM=1e-7; const double P=3.141592653;//5898; double r,R,H,V;
    
    
    
    
double com(double x) {  double r2;  double temp2;  temp2=(R-r)/H;  r2=r+temp2*x;  return  P*(r*r+r2*r2+r*r2)*x/3>V; }
    
    
    
    
int main() {  int t;  cin>>t;     while(t--)  {   scanf("%lf%lf%lf%lf",&r,&R,&H,&V);   double low=0;   double high=H;   double mid=(low+high)/2;   while(high-low>MSM)   {   // cout<<low<<"  "<<high<<endl;    if(com(mid))     high=mid;    else     low=mid;    mid=(low+high)/2;   }
    
    
    
    
  printf("%.6lf\n",mid);  }  return 0; }