快速幂

快速幂：不断将底数平方，指数减半

C++：

#include <bits/stdc++.h>
using namespace std;
int pow(int a, int b, int mod) {
    int res = 1;
    while (b) {
        if (b & 1) {
            res = (long long)res * a % mod;
        }
        a = (long long)a * a % mod;
        b >>= 1;
    }
    return res % mod;
}
int main() {
    int a, b, mod;
    cin >> a >> b >> mod;
    cout << pow(a, b, mod) << endl;
    return 0;
}

Python3：

print(pow(a, b, mod))

矩阵快速幂：上述快速幂模板稍微修改即可，将整数乘法部分改为自己编写的矩阵乘法，算法思想不变

例题：矩阵快速幂

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
vector<vector<ll>> mat_mul(vector<vector<ll>>& a, vector<vector<ll>>& b) { // 矩阵乘法
    ll n = a.size(), m = b[0].size();
    vector<vector<ll>> c(n, vector<ll> (m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = 0; k < m; k++) {
                c[i][j] = ((a[i][k] * b[k][j]) % mod + c[i][j]) % mod;
            }
        }
    }
    return c;
}
vector<vector<ll>> mat_pow(vector<vector<ll>>& a, ll b) {
    int n = a.size();
    vector<vector<ll>> res(n, vector<ll> (n));
    // 把res初始化为n阶单位矩阵
    for (int i = 0; i < n; i++) {
        res[i][i] = 1;
    }
    while (b) {
        if (b & 1) {
            res = mat_mul(res, a);
        }
        a = mat_mul(a, a);
        b >>= 1;
    } 
    return res;
}
int main() {
    ll n, b;
    cin >> n >> b;
    vector<vector<ll>> a(n, vector<ll> (n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
        }
    }
    vector<vector<ll>> res = mat_pow(a, b);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << res[i][j] << ' ';
        }
        cout << endl;
    }
    return 0;
}

矩阵快速幂求斐波那契数列第n项：

斐波那契数列定义：F[n] = F[n - 1] + F[n - 2]（n > 1)，F[0] = 0, F[1] = 1

构造矩阵：，此时有      

则有：     

那么问题就变成了求 ，用上面的模板随便求一下就行

题：acwing 205. 斐波那契

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 10000;
vector<vector<ll>> mat_mul(vector<vector<ll>>& a, vector<vector<ll>>& b) { // 矩阵乘法
    ll n = a.size(), m = b[0].size();
    vector<vector<ll>> c(n, vector<ll> (m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = 0; k < m; k++) {
                c[i][j] = ((a[i][k] * b[k][j]) % mod + c[i][j]) % mod;
            }
        }
    }
    return c;
}
vector<vector<ll>> mat_pow(vector<vector<ll>>& a, ll b) {
    int n = a.size();
    vector<vector<ll>> res(n, vector<ll> (n));
    // 把res初始化为n阶单位矩阵
    for (int i = 0; i < n; i++) {
        res[i][i] = 1;
    }
    while (b) {
        if (b & 1) {
            res = mat_mul(res, a);
        }
        a = mat_mul(a, a);
        b >>= 1;
    } 
    return res;
}
int main() {
    ll n;
    while (cin >> n, n != -1) {
        vector<vector<ll>> m = {{1, 1}, {1, 0}};
        vector<vector<ll>> res = mat_pow(m, n);
        cout << res[1][0] << endl;
    }
    return 0;
}