【题目】点击打开链接
【题解】上网上查了一些资料,并且整理了一下,就是
p(n,1)= 2*f(n-1)+2^(n-3)
p(n,k)=
a_n = 2^(n-1) + (n-2)*2^(n-3);
那么就好说了。
#pragma warning(disable:4786)
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<ctime>
#include<string.h>
using namespace std;
#define pi acos(-1.0)
//#define LL __int64
typedef long long LL;
#define INF 0x7fffffffffffffff
#define bug puts("hear!")
#define inf 0x7fffffff
#define eps 1e-10
#define FRE freopen("in.txt","r",stdin)
#define E exp(1.0)
#define MOD 1000000007
long long power_2(long long n)
{
if(n==0)
return 1;
if(n==1)
return 2;
long long diver=power_2(n/2);
if(n%2==1)
{
return (diver*diver*2)%MOD;
}
else if(n%2==0)
return (diver*diver)%MOD;
}
int main()
{
int n;
cin>>n;
while(n--)
{
int a,b;
cin>>a>>b;
int p=a-b+1;
if(p<=0)
{
cout<<0<<endl;
}
else if(p==1)
{
cout<<1<<endl;
}
else
{
long long resu=(power_2(p-1)+(p-2)*power_2(p-3))%MOD;
cout<<resu<<endl;
}
}
return 0;
}