高数模板题简直了666
#include<stdio.h>
#include <vector>
#include <string.h>
#include<iostream>
#include<cmath>
#include <algorithm>
#include <queue>
using namespace std;
const double pi=acos(-1);//pi就是π是180°
int main()
{
int t;
scanf("%d",&t);
int cnt=1;
while(t--)
{
double a,b,k,ans,l;
scanf("%lf%lf%lf",&a,&b,&k);
l=pi*a*b;
ans=4.0/3.0*a*b*b*pi;
if(k>=b);
else
{
ans-=l*((b-k)-(b/3.0-k*k*k/3.0/b/b));
}
printf("Case %d: %.3f\n",cnt++,ans);
}
return 0;
}
