分析
-
一般递推式
-
向量递推式
代码
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define MXM 4
#define mod(x) ((x)%1000000007)
int L, M;
int A[MXM][MXM]={{1,1,1,1},{0,1,1,1},{0,1,0,0},{0,0,1,0}};
struct mat{
LL d[MXM][MXM];
mat operator*(const mat x){
mat ret;
LL tmp;
for(int i = 0; i < MXM; i++){
for(int j = 0; j < MXM; j++){
tmp = 0;
for(int k = 0; k < MXM; k++){
tmp = mod(tmp + d[i][k]* x.d[k][j]);
}
ret.d[i][j] = tmp;
}
}
return ret;
}
void init_unit(){
for(int i = 0; i < MXM; i++)
for(int j = 0; j < MXM; j++) d[i][j] = i == j ? 1 : 0;
}
void init(){
for(int i = 0; i < MXM; i++)
for(int j = 0; j < MXM; j++) d[i][j] = A[i][j];
}
}ma;
mat matrixPow(mat base, int pow){
mat res;
res.init_unit();
while(pow){
if(pow & 1) res = res * base;
base = base * base;
pow >>= 1;
}
return res;
}
int sum(int x){
if(x < 0) return 0;
else if(x == 0) return 1;
else if(x == 1) return 2;
else if(x == 2) return 3;
ma.init();
ma = matrixPow(ma, x-2);
return mod(3*ma.d[0][0]+ma.d[0][1]+ma.d[0][2]+ma.d[0][3]);
}
int main(){
int a, b;
while(scanf("%d%d", &a, &b) == 2){
printf("%d\n", mod(sum(b)-sum(a-1)+1000000007));
}
return 0;
}