[算法]矩阵快速幂

注意：如果有n的k次方，那就把n的k次方写成k个n相乘，然后补k行k列就好了。
求(a_n = a_{n – 1} + 2 * a_{n – 2} + n^3)
首先我们需要知道立方和完全展开式：((a – b)^3 = a^3 – 3 a^2 b + 3 a b^2 – b^3)
然后配就行了((i + 1)^3 = i^3 + 3 i^2 + 3 i + 1)。
有一个要注意的地方是，最后要拿转移矩阵的n次方的第一行乘上初始列才是答案。
（推完之后发现这矩阵好像杨辉三角形，如果有更高次项应该能按杨辉三角形直接补一行一列就完事了。）

struct matrix
{
    ll m[7][7] = {};
}ans, res;
matrix mul(matrix left, matrix right)
{
    matrix anst;
    for (int k = 1; k <= 6; ++k){
        for (int i = 1; i <= 6; ++i){
            for (int j = 1; j <= 6; ++j){
                anst.m[i][j] += left.m[i][k] * right.m[k][j];
                anst.m[i][j] %= mod;
            }
        }
    }
    return anst;
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--){
    for (int i = 1; i <= 6; ++i){
        for (int j = 1; j <= 6; ++j){
            res.m[i][j] = 0;
            if (i == j) ans.m[i][j] = 1;
            else ans.m[i][j] = 0;
        }
    }
    res.m[1][1] = res.m[1][3] = res.m[2][1] = res.m[3][3] = res.m[3][6] = res.m[4][4] = res.m[4][6] = res.m[5][5] = res.m[5][6] = res.m[6][6] = 1;
    res.m[1][2] = res.m[4][5] = 2;
    res.m[3][4] = res.m[3][5] = 3;
    ll n;
    scanf("%lld", &n);
    n -= 2;
    while (n){
        if (n & 1) ans = mul(res, ans);
        res = mul(res, res);
        n >>= 1;
    }
    printf("%lld\n", (2 * ans.m[1][1] + ans.m[1][2] + 27 * ans.m[1][3] + 9 * ans.m[1][4] + 3 * ans.m[1][5] + ans.m[1][6]) % mod);
    }
    return 0;
}

求斐波那契第n项

#include<stdio.h>
#define mod 1000000007
typedef long long ll;
struct matrix
{
    ll m[3][3] = {};
}ans, res;
matrix mul(matrix left, matrix right)
{
    matrix anst;
    for (int k = 1; k <= 2; ++k){
        for (int i = 1; i <= 2; ++i){
            for (int j = 1; j <= 2; ++j){
                anst.m[i][j] += left.m[i][k] * right.m[k][j];
                anst.m[i][j] %= mod;
            }
        }
    }
    return anst;
}
int main()
{
    res.m[1][1] = res.m[1][2] = res.m[2][1] = 1, res.m[2][2] = 0;
    ans.m[1][1] = ans.m[2][2] = 1, ans.m[1][2] = ans.m[2][1] = 0;
    ll n;
    scanf("%lld", &n);
    while (n){
        if (n & 1) ans = mul(res, ans);
        res = mul(res, res);
        n >>= 1;
    }
    printf("%lld\n", ans.m[1][2]);
    return 0;
}

求矩阵的k次方
https://www.luogu.org/problemnew/show/P3390

#include<stdio.h>
#define mod 1000000007
typedef long long ll;
struct matrix
{
    ll m[105][105] = {};
}ans, res;
int n;
matrix mul(matrix left, matrix right)
{
    matrix anst;
    for (int k = 1; k <= n; ++k){
        for (int i = 1; i <= n; ++i){
            for (int j = 1; j <= n; ++j){
                anst.m[i][j] += left.m[i][k] * right.m[k][j] % mod;
                anst.m[i][j] %= mod;
            }
        }
    }
    return anst;
}
int main()
{
    ll k;
    scanf("%d %lld", &n, &k);
    for (int i = 1; i <= n; ++i){
        ans.m[i][i] = 1;
        for (int j = 1; j <= n; ++j){
            scanf("%lld", &res.m[i][j]);
        }
    }
    while (k){
        if (k & 1) ans = mul(res, ans);
        res = mul(res, res);
        k >>= 1;
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            printf(j == n ? "%lld\n" : "%lld ", ans.m[i][j]);
        }
    }
    return 0;
}