矩阵快速幂——斐波那契前n项和

其实就是挂一下强哥的板子。

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int mod;
struct mat {
    ll a[3][3], n;
    mat() { memset(a, 0, sizeof(a)); }
    void matE() {
        for (int i = 0; i < n; i++)a[i][i] = 1;
    }
    inline mat operator+(const mat &T) const {
        mat res;
        res.n = n;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                res.a[i][j] = (a[i][j] + T.a[i][j] + mod) % mod;
        return res;
    }
    inline mat operator-(const mat &T) const {
        mat res;
        res.n = n;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                res.a[i][j] = (a[i][j] - T.a[i][j] + mod) % mod;
        return res;
    }
    inline mat operator*(const mat &T) const {
        mat res;
        res.n = n;
        ll r;
        for (int i = 0; i < n; ++i)
            for (int k = 0; k < n; ++k) {
                r = a[i][k];
                for (int j = 0; j < n; ++j)
                    res.a[i][j] += T.a[k][j] * r,
                            res.a[i][j] %= mod;
            }
        return res;
    }
    inline mat pow(ll x) {
        mat res, bas;
        res.n = bas.n = n;
        for (int i = 0; i < n; i++) res.a[i][i] = 1;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) bas.a[i][j] = a[i][j];
        while (x) {
            if (x & 1) res = res * bas;
            x >>= 1;
            bas = bas * bas;
        }
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) a[i][j] = res.a[i][j];
        return res;
    }
}f,a,res;
int main()
{
    int n; cin>>n>>mod;
    f.a[0][0]=f.a[0][1]=f.a[0][2]=1;
    a.a[0][1]=a.a[1][0]=a.a[1][1]=a.a[1][2]=a.a[2][2]=1;
    f.n=a.n=3;
    n--;
    a.pow(n);
    res=f*a;
    cout<<res.a[0][2]<<endl;
}