直接上大佬的题解 传送门
我的代码
状态矩阵
F
(
n
)
=
(
f
(
n
)
f
(
n
+
1
)
1
)
F(n) = \begin{pmatrix} f(n) & f(n + 1) & 1 \end{pmatrix}
F(n)=(f(n)f(n+1)1)
转移矩阵
A
=
(
0
2
0
1
0
1
0
1
1
)
A = \begin{pmatrix} 0 & 2 & 0 \\ 1 & 0 & 1 \\ 0 & 1 & 1 \end{pmatrix}
A=⎝⎛010201011⎠⎞
初始状态
F
(
1
)
=
(
1
2
1
)
F(1) = \begin{pmatrix} 1 & 2 & 1 \end{pmatrix}
F(1)=(121)
递推方程
F
(
n
−
1
)
=
F
(
1
)
∗
A
n
−
2
F(n - 1) = F(1) * A^{n-2}
F(n−1)=F(1)∗An−2
答案 F[n - 1][1]
#include<bits/stdc++.h>
#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define ull unsigned long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6 + 10;
const int SIZE=3;
ll mod = 200907;
struct matrix
{
ll mat[SIZE][SIZE];
matrix(){memset(mat,0,sizeof mat);}
matrix operator * (const matrix & x)const
{
matrix ans;
for(int i=0;i<SIZE;i++)
for (int j = 0; j < SIZE; j++)
for (int k = 0; k < SIZE; k++)
ans.mat[i][j] = (ans.mat[i][j] + x.mat[i][k] * mat[k][j]) % mod;
return ans;
}
};
void Pow(int b)
{
matrix one, a ;
for (int i = 0; i < SIZE; i++)
one.mat[i][i] = 1;
a.mat[0][0] = a.mat[0][2] = a.mat[1][2] = a.mat[2][0] = 0;
a.mat[1][0] = a.mat[1][1] = a.mat[2][1] = a.mat[2][2] = 1;
a.mat[0][1] = 2;
while (b)
{
if (b & 1)
one = one * a;
a = a * a;
b >>= 1;
}
ll ans[3] = { 1,2,1 }, c[3] = { 0 };
for (int j = 0; j < 3; j++)
for (int k = 0; k < 3; k++)
c[j] = (c[j] + ans[k] * one.mat[k][j]) % mod;
cout << c[1] << endl;
}
int main()
{
matrix a;
int n;
while (cin >> n && n)
{
if (n == 1) { cout << 1 << endl; continue; }
else if (n == 2) { cout << 2 << endl; continue; }
else Pow(n - 2);;
}
return 0;
}