矩阵快速幂

板子：

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll Mod = 1e9 + 7;
ll n, k;
struct matrix
{
    ll m[105][105];
} a;
matrix x(matrix a, matrix b)
{
    matrix t;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            t.m[i][j] = 0;
            for (int k = 0; k < n; k++)
                t.m[i][j] = (t.m[i][j] + a.m[i][k] * b.m[k][j]) % Mod;
        }
    return t;
}
matrix fast_m(matrix a, ll k)
{
    matrix t = a, b = a;
    while (k > 0)
    {
        if (k % 2 == 1)
            t = x(b, t);
        b = x(b, b);
        k /= 2;
    }
    return t;
}
int main()
{
    cin >> n >> k;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> a.m[i][j];
    a = fast_m(a, k - 1);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
            cout << a.m[i][j] << ' ';
        cout << endl;
    }
    return 0;
}

就是简单的矩阵乘法加快速幂，可以用于某些递推式的时间复杂度优化。比如斐波那契数列。

使用此公式可以将第F_n项和F_n-1项的通项公式求出，即：

F_n=

(n>=2)