值得注意的是在求矩阵的时候,将b+2和a+1看做一个整体来处理,不要处理了两遍
另一方面,虽然b>a, 但是由于这9位数是求余之后的,所以有可能是负数,负数求余公式(ans%Mod+Mod)%Mod
#include <iostream>
#include <cstdio>
using namespace std;
#define MAX 2
#define Mod 1000000000
typedef struct
{
long long m[MAX][MAX];
}Matrix;
Matrix P={0,1,1,1};
Matrix I={1,0,0,1};
Matrix matrixmul(Matrix a,Matrix b) //矩阵乘法
{
int i,j,k;
Matrix c;
for (i = 0 ; i < MAX; i++)
for (j = 0; j < MAX;j++)
{
c.m[i][j] = 0;
for (k = 0; k < MAX; k++)
c.m[i][j] += (a.m[i][k] * b.m[k][j])%Mod;
c.m[i][j] %= Mod;
}
return c;
}
Matrix quickpow(long long n)
{
Matrix m = P, b = I;
while (n >= 1)
{
if (n & 1)
b = matrixmul(b,m);
n = n >> 1;
m = matrixmul(m,m);
}
return b;
}
int main()
{
int a,b;
long long ans1,ans2,ans;
while(scanf("%d%d",&a,&b)!=EOF)
{
if(a==0&&b==0) break;
Matrix c,d;
c=quickpow(b+1);
d=quickpow(a);
ans1=(c.m[0][0]%Mod+c.m[0][1]*2%Mod)%Mod;
ans2=(d.m[0][0]%Mod+d.m[0][1]*2%Mod)%Mod;
ans=ans1-ans2;
ans=(ans%Mod+Mod)%Mod;
cout<<ans<<endl;
//cout<<ans2<<endl;
}
return 0;
}