矩阵快速幂

矩阵快速幂模板

const ll MAXN = 2;//矩阵的阶
struct Matrix {
   
	ll m[MAXN][MAXN];
	Matrix() {
    memset(m, 0, sizeof(m)); }
};
Matrix Multi(Matrix a,Matrix b) {
   // 矩阵乘法
    Matrix ans;
    for (int i = 0; i < MAXN; ++i) {
   
        for (int j = 0; j < MAXN; ++j) {
   
            for (int k = 0; k < MAXN; ++k) {
   
                ans.m[i][j] = (ans.m[i][j] + a.m[i][k] * b.m[k][j]) % MOD;
            }
        }
    }
    return ans;
}
Matrix fastm(Matrix a, ll n) {
   
    Matrix ans;
    for (int i = 0; i < MAXN; i++)ans.m[i][i] = 1;//初始化为单位矩阵
    while (n > 0) {
   
        if (n & 1)ans = Multi(ans, a);
        a = Multi(a, a);
        n >>= 1;
    }
    return ans;
}

题目

AcWing 205. 斐波那契

题目描述

在斐波那契数列中，$Fi{b}_0=0,Fi{b}_1=1,Fibn=Fi{b}_{n-1}+Fi$