Jan’s LightOJ :: 1297 - Largest Box Solution

1297 - Largest Box

#include <stdio.h>
#include <math.h>

int main()
{
        int T,i;
        double L,W,x;
        scanf("%d",&T);
        for(i =0; i<T; i++)
        {
                scanf("%lf%lf",&L,&W);
                x = (W+L-sqrt(W*W+L*L-W*L))/6;
                printf("Case %d: %lf\n",i+1,(W-2*x)*(L-2*x)*x);


        }
        return 0;


}