HDU 4112 Break the Chocolate

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
int oor(int k){
    for(int i=0;;i++)
    if((1<<i)>=k) return i;
}
int main()
{
    freopen("in.txt","r",stdin);
    int cas,T=1;
    int a,b,c;
    scanf("%d",&cas);
    while(cas--){
        scanf("%d%d%d",&a,&b,&c);
        long long ans1=0,ans2=0;
        ans2=oor(a)+oor(b)+oor(c);
        ans1= 1ll*a*b*c-1;
        cout<<"Case #"<<(T++)<<": "<<ans1<<" "<<ans2<<endl;
    }
    return 0;
}