UmBasketella

UmBasketella

http://poj.org/problem?id=3737

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9489		Accepted: 3674

Description

In recent days, people always design new things with multifunction. For instance, you can not only use cell phone to call your friends, but you can also use your cell phone take photographs or listen to MP3. Another example is the combination between watch and television. These kinds of multifunction items can always improve people's daily life and are extremely favored by users.

The company Mr. Umbrella invented a new kind umbrella "UmBasketella" for people in Rainbow city recently and its idea also comes from such multifunction--the combination of umbrella and daily necessities. This kind of umbrella can be used as a basket and you can put something you want to carry in it. Since Rainbow city rains very often, such innovative usage is successful and "UmBasketella" sells very well. Unfortunately, the original "UmBasketella" do not have an automatic volume control technology so that it is easily damaged when users try to put too many things in it. To solve this problem, you are needed to design an "UmBasketella" with maximum volume. Suppose that "UmBasketella" is a cone-shape container and its surface area (include the bottom) is known, could you find the maximum value of the cone?

Input

Input contains several test cases. Eash case contains only one real number S, representing the surface area of the cone. It is guaranteed that 1≤S≤10000.

Output

For each test case, output should contain three lines.
The first line should have a real number representing the maximum volume of the cone. 
Output the height of the cone on the second line and the radius of the bottom area of the cone on the third line.
All real numbers should rounded to 0.01.

Sample Input

30

Sample Output

10.93
4.37
1.55

Source

PKU Campus 2009 (POJ Monthly Contest – 2009.05.17), cyqclark

 

 

三分模板题

 #include<cstdio>
 #include<cmath>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define eps 1e-8
 #define pi acos(-1.0)
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 
 double s;
 
 double cal(double r){
     double l=s/pi/r-r;
     double h=sqrt(l*l-r*r);
     double v=pi*r*r*h/3.0;
     return v;
 }
 
 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
   //  std::ios::sync_with_stdio(false);
     while(~scanf("%lf",&s)){
         double L=,R=sqrt(s/2.0/pi),mid1,mid2;
         while(R-L>eps){
             mid1=L+(R-L)/;
             mid2=R-(R-L)/;
             if(cal(mid1)>=cal(mid2)){
                 R=mid2;
             }
             else{
                 L=mid1;
             }
         }
         double l=s/pi/R-R;
         double h=sqrt(l*l-R*R);
         double v=pi*R*R*h/3.0;
         printf("%.2f\n%.2f\n%.2f\n",v,h,R);
     }
 }