Hi,
I’m getting WA on that problem: http://www.spoj.com/problems/BC/
#include<iostream>
using namespace std;
int main()
{
int i,t;
long long int n,m,k;
cin>>t; // test cases
long long int size[t][3];
if( t>0 && t<=10000){
for (i=0;i<t;i++)
cin >> size[i][0] >> size[i][1] >> size[i][2]; // dimensions of various chocolates: n,m,k
// for breaking by hand, each cube has to be broken separately. so (n*m*k)-1 times.
//for breaking by knife, number of cuts needed is (n-1)+(m-1)+(k-1)
for(i=0;i<t;i++){
n=size[i][0];
m=size[i][1];
k=size[i][2];
if(n<=2000 && m<=2000 && k<=2000 && n>0 && m>0 && k>0)
cout << "Case #" << i+1 << ": " << n*m*k-1 << " " << n+m+k-3 << endl;
}
}
return 0;
}