HDU 4602 快速求幂

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
#include <cassert>
#include <complex>
using namespace std;
typedef long long ll;
typedef long double ld;
const int int_max = 0x07777777;
const int int_min = 0x80000000;
const int inf=0x20202020;
const ll mod=1000000007;
const double eps=1e-9;
const double pi=3.1415926535897932384626;
const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll powmod(ll a,ll b,ll mod) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
bool cmp (const void *a , const void *b )
{
    return *(int *)a < *(int *)b;
}
ll n,k;
int main()
{
    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%I64d %I64d",&n,&k);
        if(k > n) printf("0\n");
        else{
            if(n==k) {printf("1\n"); continue;}
            if(n==k+1) {printf("2\n"); continue;}
            ll result = 4;
            result += n-k-1;
            result %= mod;
            ll t = powmod(2,n-k-2);
            result *= t;
            result %= mod;
            printf("%I64d\n", result);
        }
    }
}

当i>=k+2的时候，result[i]=2*result[i-1]+pow(2,i-k-2)；