Lightoj1216——Juice in the Glass （计算几何）

Once upon a time, there lived a mad programmer. He loved to solve creative problems other than anything. His wife loved him quite a lot but disliked his curiosity for the problems. One day he came from office, his wife gave him a glass of cold lime juice. She was in a romantic mood and waiting for some romantic stuff. But the programmer asked her curiously, “If I give u radius of the top and bottom part of the glass and the height, can you come up with the volume of the glass?” His wife became a bit disappointed but as she is smart she replied with a smile, “You already have drunk some juice, and the glass is not full. If I give you the height of the juice, can you find the volume of the remaining juice in the glass?” Then the programmer kissed his wife and said, “You are the best problem setter in the world!”

Now he set the same problem for you. The radius of the upper part r1 and lower part r2 is given. If height of the glass is h and height of the juice is p what is the volume of the juice in the glass?

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing four integers r1 r2 h p (1 ≤ r2 < r1 ≤ 100, 1 ≤ p ≤ h ≤ 100).

Output

For each case, print the case number and the volume of the juice in the glass. Errors less than 10-6 will be ignored.

Sample Input
2

5 2 3 2

5 2 3 3
Output for Sample Input
Case 1: 58.643062867

Case 2: 122.52211349

设圆台的上底为r，下底为R，高为h，则体积V=PI*h*(r^2+R*r+r*r)/3
这里液体的下底可以由(r-r2)/(r1-r2)=p/h推出

#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAXN 2005
#define Mod 10001
using namespace std;
int main()
{
    int t,cnt=1;
    scanf("%d",&t);
    while(t--)
    {
        double r1,r2,h,p;
        scanf("%lf%lf%lf%lf",&r1,&r2,&h,&p);
        double r=p/h*(r1-r2)+r2;
        double ans=M_PI*p*(r*r+r*r2+r2*r2)/3;
        printf("Case %d: %.8lf\n",cnt++,ans);
    }
    return 0;
}