hdu - 4602 《Partition》

Problem Description

Define f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have
  4=1+1+1+1
  4=1+1+2
  4=1+2+1
  4=2+1+1
  4=1+3
  4=2+2
  4=3+1
  4=4
totally 8 ways. Actually, we will have f(n)=2 ^(n-1) after observations.
Given a pair of integers n and k, your task is to figure out how many times that the integer k occurs in such 2 ^(n-1) ways. In the example above, number 1 occurs for 12 times, while number 4 only occurs once.

 

Input

The first line contains a single integer T(1≤T≤10000), indicating the number of test cases.
Each test case contains two integers n and k(1≤n,k≤10 ⁹).

 

Output

Output the required answer modulo 10 ⁹+7 for each test case, one per line.

 

Sample Input

  
  

   
   2
4 2
5 5
  
  

 

Sample Output

  
  

   
   5
1
  
  

 

【实现代码】

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
long long powermod(long long n)
{
    if(n<0)return 0;
    long long ans=1,c=2;
    while(n){
        if(n%2)
            ans=(c*ans)%1000000007;
            c=(c*c)%1000000007;
            n/=2;
        }
    return ans;
}
int main()
{
//    char STD[102400]="";
//    freopen("in.txt","r",stdin);
//    fread(STD,1,1024,stdin);
//    printf("---------input---------\n%s\n---------output---------\n",STD);
//    freopen("in.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        n=n-k-1;
        printf("%lld\n",(powermod(n+1)+n*powermod(n-1))%1000000007);
    }
    return 0;
}