由于是斐波那契数列性质的数列,可以类比对斐波那契数列求矩阵快速幂解法,但是这个矩阵不是单纯的二阶矩阵了,我们会发现n > 6时每一次递推至少需要五个因子,所以应该构建一个五阶矩阵,很容易就构建好
| 1 1 1 0 0|
| 1 0 0 0 0|
| 0 1 0 0 0|
| 0 0 1 0 0|
| 0 0 0 1 0|
然后根据这个进行递推,特判前五项,之后就是套矩阵快速幂的模板了
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
#define mod 1000000007
struct node
{
long long m[5][5];
}ans;
node mulp(node a, node b)
{
node temp;
memset(temp.m, 0, sizeof(temp.m));
for(int i = 0; i < 5; i ++)
for(int k = 0; k < 5; k ++){
if(a.m[i][k] == 0) continue;
for(int j = 0; j < 5; j ++){
if(b.m[k][j] == 0) continue;
temp.m[i][j] = (temp.m[i][j] + a.m[i][k] * b.m[k][j]) % mod;
}
}
return temp;
}
long long matrix_power(node a, long long b)
{
memset(ans.m, 0, sizeof(ans.m));
ans.m[0][0] = ans.m[1][1] = ans.m[2][2] = ans.m[3][3] = ans.m[4][4] = 1;
while(b)
{
if(b & 1) ans = mulp(ans, a);
a = mulp(a, a);
b >>= 1;
}
return (ans.m[0][0] * 13 % mod + ans.m[0][1] * 7 % mod + ans.m[0][2] * 4 % mod + ans.m[0][3] * 2 % mod + ans.m[0][4] %mod) % mod;
}
int main()
{
long long n;
while(scanf("%lld",&n) != EOF)
{
if(n == 1) { printf("1\n"); continue; }
if(n == 2) { printf("2\n"); continue; }
if(n == 3) { printf("4\n"); continue; }
if(n == 4) { printf("7\n"); continue; }
if(n == 5) { printf("13\n"); continue; }
node base = {1,1,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0};
printf("%lld\n",matrix_power(base, n - 5));
}
return 0;
}