有关矩阵乘法的学习

原先对矩阵不是很熟悉，用法也不清楚。有神犇给我推荐了这么一个网址十个利用矩阵乘法解决的经典题目.自己对着里面的题目写了一遍深有感触他在里面的题解已经很详细了，我主要是写在博客上保存这么一个网址和我自己题解的代码。

这里顺便放一下自己的矩阵乘法板子（自认为比较好理解，效率也可以）：

//a矩阵n行m列，b矩阵m行q列，aXb得到ans矩阵n行q列
Matrix mul(Matrix a,Matrix b){
    Matrix ans;
    for(int k = 1;k <= m;k++) //这里是枚举中间相同的,a的列，b的行
        for(int i = 1;i <= n;i++)//a矩阵的行
        //这里要想少算一些，可以把n和q哪个小，哪个放上面，当然如果只有a矩阵可能出现0的情况就把n放上面，反之放q
            if(a.m[i][k])//如果该位是0就不用算了
                for(int j = 1;j <= q;j++)//b矩阵的列
                    ans.m[i][j] += a.m[i][k]*b.m[k][j];
    return ans;
}

T3:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

int n,m,k;
struct Matrix{
    int m[35][35];
    Matrix(){
        memset(m,0,sizeof m);
    }
}a;

Matrix mul(Matrix a,Matrix b){
    Matrix ans;
    for(int k = 1;k <= n;k++)
        for(int i = 1;i <= n;i++)
            if(a.m[i][k])
                for(int j = 1;j <= n;j++)
                    ans.m[i][j] = (ans.m[i][j]+a.m[i][k]*b.m[k][j])%m;
    return ans;
}

Matrix add(Matrix a,Matrix b){
    Matrix ans;
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= n;j++)
            ans.m[i][j] = (a.m[i][j]+b.m[i][j])%m;
    return ans;
}

Matrix quick(Matrix x,int k){
    Matrix ans;
    for(int i = 1;i <= n;i++)
        ans.m[i][i] = 1;
    while(k){
        if(k&1) ans = mul(ans,x);
        x = mul(x,x);
        k >>= 1;
    }
    return ans;
}

Matrix erfen(Matrix a,int k){
    if(k == 1) return a;
    Matrix b = erfen(a,k/2);
    Matrix ans;
    Matrix x = quick(a,k/2);
    ans = mul(b,x);
    ans = add(ans,b);
    if(k%2 != 0){
        x = quick(a,k);
        ans = add(ans,x);
    }
    return ans;
}

int main(){
    n = read(); k = read(); m = read();
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= n;j++)
            a.m[i][j] = read();
    Matrix ans = erfen(a,k);
    for(int i = 1;i <= n;i++,puts(""))
        for(int j = 1;j <= n;j++)
            printf("%d ",ans.m[i][j]);
    return 0;
}

T4:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
#define N 105
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

int n,m,k;
struct Matrix{
    int m[N][N];
    Matrix(){
        memset(m,0,sizeof m);
    }
}a[15],ans,b;

Matrix mul1(Matrix a,Matrix b){
    Matrix ans;
    for(int k = 1;k <= n;k++)
        for(int i = 1;i <= n;i++)
            if(a.m[i][k])
                for(int j = 1;j <= n;j++)
                    ans.m[i][j] += a.m[i][k]*b.m[k][j];
    return ans;
}

Matrix mul2(Matrix a,Matrix b){
    Matrix ans;
    for(int k = 1;k <= n;k++)
        for(int i = 1;i <= n;i++)
            if(a.m[i][k])
                ans.m[i][1] += a.m[i][k]*b.m[k][1];
    return ans;
}

Matrix quick(Matrix a,int k){
    Matrix ans;
    for(int i = 1;i <= n;i++)
        ans.m[i][i] = 1;
    while(k){
        if(k&1) ans = mul1(ans,a);
        k >>= 1;
        a = mul1(a,a);
    }
    return ans;
}

int main(){
    n = read(); m = read(); k = read();
    for(int i = 1;i <= m;i++){
        for(int j = 1;j <= n;j++){
            int x = read();
            a[i].m[j][x] = 1;
        }
    }
    for(int i = 2;i <= m;i++)
        a[i] = mul1(a[i],a[i-1]);
    ans = quick(a[m],k/m);
    if(k%m != 0)
        ans = mul1(a[k%m],ans);
    for(int i = 1;i <= n;i++)
        b.m[i][1] = i;
    ans = mul2(ans,b);
    for(int i = 1;i < n;i++)
        printf("%d ",ans.m[i][1]);
    printf("%d\n",ans.m[n][1]);
    return 0;
}

T7:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define mod 7777777
inline ll read(){
    ll x = 0,f = 1;char ch = getchar();
    while(ch < '0' || ch > '9'){ if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9'){ x = x*10+ch-'0'; ch = getchar(); }
    return x*f;
}

struct matrix{
    ll m[14][14];
    matrix(){
        memset(m,0,sizeof m);
    }
}a,b;
ll k,n;
ll f[15];

matrix mul(matrix a,matrix b){
    matrix ans;
    for(ll k = 1;k <= n;k++)
        for(ll i = 1;i <= n;i++)
            if(a.m[i][k])
                for(ll j = 1;j <= n;j++)
                    ans.m[i][j] = (ans.m[i][j]+a.m[i][k]*b.m[k][j])%mod;
    return ans;
}

matrix quick(matrix a,ll p){
    matrix ans;
    for(ll i = 1;i <= n;i++)
        ans.m[i][i] = 1;
    while(p){
        if(p & 1) ans = mul(ans,a);
        p >>= 1;
        a = mul(a,a);
    }
    return ans;
}

matrix mul2(matrix a,matrix b){
    matrix ans;
    for(ll k = 1;k <= n;k++)
        for(ll i = 1;i <= n;i++)
            if(a.m[i][k])
                ans.m[i][1] = (ans.m[i][1]+a.m[i][k]*b.m[k][1])%mod;
    return ans;
}

int main(){
    n = read(); k = read();
    for(ll i = 1;i < n;i++)
        a.m[i][i+1] = 1;
    for(ll i = 1;i <= n;i++)
        a.m[n][i] = 1;
    a = quick(a,k);
    f[1] = 1;
    for(ll i = 1;i <= n;i++)
        for(ll j = 1;j <= i;j++)
            f[i] += f[i-j];
    for(ll i = 1;i <= n;i++)
        b.m[i][1] = f[i];
    b = mul2(a,b);
    printf("%lld\n",b.m[1][1]);
    return 0;
}

PS:虽说有十题，但只给出了九题，有些没有实题的，就没有发上去了。