矩阵快速幂复习

主要模板：

struct Matrix{
    ll m[N][N];
};

void prin(Matrix x){
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            printf("%lld, ", x.m[i][j]);
        }
        cout << endl;
    }
}
Matrix Mul(Matrix a, Matrix b){
    Matrix c;
    clr(c.m);
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            for(ll k = 0; k < N; k++)
                c.m[i][j] = (c.m[i][j] + (a.m[i][k]*b.m[k][j]) % m + m) % m;
    return c;
}
Matrix fastm(Matrix a, int n){
    Matrix res;
    clr(res.m);
    for(int i = 0; i < N; i++)
        res.m[i][i] = 1;
    while(n){
        if(n & 1) res = Mul(res, a);
        n >>= 1;
        a = Mul(a, a);
    }
    return res;
}

构造矩阵是关键。

 

HDU - 1575 Tr A

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-------------"<<endl

typedef long long ll;
const ll maxn = 1e5 + 10;
const ll MAXN = 1e6 + 10;
const ll INF = 0x3f3f3f3f;
const ll MOD = 9973;
const ll N = 10;

ll T, n, k;
struct Matrix{
    ll m[N][N];
}pre;

Matrix Mul(Matrix a,Matrix b){
    Matrix c;
    memset(c.m, 0, sizeof(c.m));
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            for(ll k = 0; k < N; k++)
                c.m[i][j] = (c.m[i][j] + (a.m[i][k]*b.m[k][j]) % MOD + MOD)%MOD;
    return c;
}
void prin(Matrix x){
    for(ll i = 0; i < N; i++){
        for(ll j = 0; j < N; j++){
            printf("%lld, ", x.m[i][j]);
        }
        cout << endl;
    }
}
void clean(Matrix x){
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            x.m[i][j] = 0;
}
void init(Matrix x){
    for(ll i = 0; i < N; i++)
        x.m[i][i] = 1;
}
Matrix fastm(Matrix a,ll n) {
    Matrix res;
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            res.m[i][j] = 0;
    for(ll i = 0; i < N; i++)
        res.m[i][i] = 1;
    //prin(res);
    while(n){
        if(n & 1)
            res = Mul(res, a);
        n >>= 1;
        a = Mul(a, a);
    }
    return res;
}


int main(){
    scanf("%d", &T);
    while(T--){
        clean(pre);
        scanf("%d%d", &n, &k);
        for(ll i = 0; i < n; i++)
            for(ll j = 0; j < n; j++)
                scanf("%lld", &pre.m[i][j]);
        Matrix fin = fastm(pre, k);
        //prin(fin);
        ll sum = 0;
        for(ll i = 0; i < n; i++){
            sum += fin.m[i][i] % MOD;
        }
        printf("%lld\n", sum % MOD);
    }
    return 0;
}

HDU - 1757 A Simple Math Problem

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))

typedef long long ll;
const int N = 10;

ll k, m;
ll a[N];
struct Matrix{
    ll m[N][N];
};

void prin(Matrix x){
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            printf("%lld  ", x.m[i][j]);
        }
        cout << endl;
    }
}
Matrix Mul(Matrix a, Matrix b){
    Matrix c;
    clr(c.m);
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            for(ll k = 0; k < N; k++)
                c.m[i][j] = (c.m[i][j] + (a.m[i][k]*b.m[k][j]) % m + m) % m;
    return c;
}
Matrix fastm(Matrix a, int n){
    Matrix res;
    clr(res.m);
    for(int i = 0; i < N; i++)
        res.m[i][i] = 1;
    while(n){
        if(n & 1) res = Mul(res, a);
        n >>= 1;
        a = Mul(a, a);
    }
    return res;
}

int main(){
    while(scanf("%lld%lld", &k, &m) != EOF){
        for(int i = 0; i < N; i++) scanf("%lld", &a[i]);
        Matrix u, v;
        clr(u.m); clr(v.m);
        for(int i = 0; i < N; i++) u.m[0][i] = a[i];
        for(int i = 0; i < N-1; i++) u.m[i+1][i] = 1;
        //prin(u);
        for(int i = 0; i < N; i++) v.m[10-i-1][0] = i;
        //prin(v);
        if(k < 10) printf("%lld\n", k);
        else{
            Matrix fin = fastm(u, k-9);
            Matrix ans = Mul(fin, v);
            printf("%lld\n", ans.m[0][0] % m);
        }
    }
    return 0;
}

HDU - 2604 Queuing

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-------------"<<endl

typedef long long ll;
const ll maxn = 1e5 + 10;
const ll MAXN = 1e6 + 10;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ll N = 4;

ll  n, m;
struct Matrix{
    ll m[N][N];
};

Matrix pre = {
    1, 0, 1, 1,
    1, 0, 0, 0,
    0, 1, 0, 0,
    0, 0, 1, 0,
};

Matrix Mul(Matrix a,Matrix b){
    Matrix c;
    memset(c.m, 0, sizeof(c.m));
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            for(ll k = 0; k < N; k++)
                c.m[i][j] = (c.m[i][j] + (a.m[i][k]*b.m[k][j]) % m + m)% m;
    return c;
}
void prin(Matrix x){
    for(ll i = 0; i < N; i++){
        for(ll j = 0; j < N; j++){
            printf("%lld, ", x.m[i][j]);
        }
        cout << endl;
    }
}
Matrix fastm(Matrix a,ll n) {
    Matrix res;
    for(ll i = 0; i < N; i++)
        for(ll j = 0; j < N; j++)
            res.m[i][j] = 0;
    for(ll i = 0; i < N; i++)
        res.m[i][i] = 1;
    //prin(res);
    while(n){
        if(n & 1)
            res = Mul(res, a);
        n >>= 1;
        a = Mul(a, a);
    }
    return res;
}


int main(){
    int a[4] = {1, 2, 4, 6};
    while(scanf("%lld%lld", &n, &m) != EOF){
        if(n == 1 || n == 0 || n == 2){
            printf("0\n");
            continue;
        }
        Matrix ans = fastm(pre, n-3);
        ll x = 0;
        for(int i = 0; i < 4; i++)
            x += (ans.m[0][i] * a[4-i-1]) % m;
        printf("%lld\n", x % m);
    }
    return 0;
}