8-12 Erratic Expansion uva12627

#include<bits/stdc++.h>
using namespace std;

long long s[35];

long long f(int k,int i)
{

    if(i<=0)return 0;
    if(k==0)return 1;
    if( i<=pow(2,k-1) )
    {
      return 2*f(k-1,i);
    }
    else
    {
        return 2*s[k-1]+f(k-1, i-pow(2,k-1) );
    }
}


int main()
{
    s[0]=1;
    for(int i=1;i<=30;i++)
      s[i]=3*s[i-1];
   int n;cin>>n;
   for(int i=1;i<=n;i++)
    {
      int k,a,b;
      scanf("%d%d%d",&k,&a,&b);
      printf("Case %d: %lld\n",i,f(k,b)-f(k,a-1) );
    }
}