【水题】2011 Asia ChenDu Regional Contest 成都现场赛 hdu 4112

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <time.h>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

#define LL long long
#define MIN INT_MIN
#define MAX INT_MAX
#define PI acos(-1.0)
#define FRE freopen("input.txt","r",stdin)
#define FF freopen("output.txt","w",stdout)
int main () {FRE;
LL n,m,k;
int t;
int ca = 1;
while(scanf("%d",&t) != -1) {
while (t--) {
scanf("%I64d%I64d%I64d",&n,&m,&k);
LL a = n*m*k - 1;
LL b = ceil(log(n*1.0)/log(2.0)) + ceil(log(m*1.0)/log(2.0)) + ceil(log(k*1.0)/log(2.0));
printf("Case #%d: %I64d %I64d\n",ca++,a,b);
}
}
return 0;
}