B - UmBasketella （三分）

Twenty-four point

Time limit:1000 ms Memory limit:65536 kB OS:Linux

---

Problem 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

---

题意：

已知一个圆锥的表面积（底面积+侧面积），求出这个圆锥的最大体积，高和底面半径。

解题思路：

圆锥面积：$〖 S=r〗^2 +lr\pi，ℎ=\sqrt{(l^2−r^2 )}$
圆锥体积：$V=r^2h\pi$

三分底面半径 $r$ ，下界为一个小的正数，上界为圆锥的高为0时的半径$r_max=S/(2r^2\pi)$

---

Code：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;


const double EPS=1e-6;
const double pi=acos(-1.0);

double v;
double vol(double r)
{
    double sc=v-pi*r*r;
    double l=sc/pi/r;
    double h=sqrt(l*l-r*r);
    return pi*r*r*h/3.0;
}

double getH(double r)
{
    double sc=v-pi*r*r;
    double l=sc/pi/r;
    return sqrt(l*l-r*r);
}


double ts()
{
    double lo=0.1,hi=sqrt(v/2.0/pi);
    double mid,mmid;
    while(hi-lo>EPS)
    {
        mid=(lo+hi)/2;
        mmid=(mid+hi)/2;
        if(vol(mid)>vol(mmid))
            hi=mmid;
        else
            lo=mid;
    }
    return lo;
}

int main()
{
    while( scanf("%lf",&v)!=EOF)
    {
        double low=ts();
        double H=getH(low);
        printf("%.2f\n",low*low*pi*H/3.0);
        printf("%.2f\n",H);
        printf("%.2f\n",low);
    }
    return 0;
}