UVA 12627 Erratic Expansion（递推）

膨胀的气球，递推啦啦啦啦

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <sstream>
#define ll long long
#define mod 1000000007
#define mod1 10001
#define mem(a) memset(a,0,sizeof(a))
using namespace std;

typedef pair <int,int> pii;
const int maxn = 12 , inf = 0x3f3f3f3f ;

ll myPow(ll a,ll b){
    ll ans = 1;
    for(ll i = 0 ; i<b;i++){
        ans*=a;
    }
    return ans;
}

ll g(ll k,ll i){
    if(k==0) return 1;
    if(i<=myPow(2,k-1)){
        return 2*g(k-1,i)+myPow(3,k-1);
    }
    else{
        return g(k-1,i-(ll)myPow(2,k-1));
    }
}

int main(){
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    ll T,K,A,B,kase = 1;
    scanf("%lld",&T);
    while(T--){
        scanf("%lld%lld%lld",&K,&A,&B);
        ll ans1 = g(K,A);
        ll ans2;
        if(B+1>myPow(2,K)) ans2=0;
        else ans2=g(K,B+1);
        printf("Case %lld: %lld\n",kase++,ans1-ans2);
    }
}