1297 – Largest Box

Problem Link

<Source Code>

#include<stdio.h>
#include<math.h>
#define pf printf

int main()
{
int t,i,n,j;
double a,b,xx;
scanf(“%d”,&t);

for(i=0;i<t;i++){
scanf(“%lf %lf”,&a,&b);
xx=(a+b-sqrt(a*a+b*b-a*b))/6.0;

pf(“Case %d: %lf\n”,i+1,(a-2*xx)*(b-2*xx)*xx);

}
return 0;
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s