矩阵乘法算法

转载一些矩阵乘法的基本操作：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 101
#define MOD 1000000007
struct Mat
{
    int a[maxn][maxn];
    Mat() {memset(a, 0, sizeof(a));}
    Mat(int i)
    {
        memset(a, 0, sizeof(a));
        for (int i=0; i<maxn; ++i)
            a[i][i] = 1;
    }
}E(1);
//两个矩阵相乘
Mat operator*(Mat a, Mat b)
{
    Mat c;
    for (int i=0; i<maxn; ++i)
        for (int j=0; j<maxn; ++j)
        {
            c.a[i][j] = 0;
            for (int k=0; k<maxn; ++k)
            {
                c.a[i][j] += a.a[i][k]*b.a[k][j];
                if (c.a[i][j]>=MOD)
                    c.a[i][j] %= MOD;
            }
        }
    return c;
}
//两个矩阵相加
Mat operator+(Mat a, Mat b)
{
    Mat c;
    for (int i=0; i<maxn; ++i)
        for (int j=0; j<maxn; ++j)
            c.a[i][j] = (a.a[i][j]+b.a[i][j])%MOD;
    return c;
}
//求A^n  对矩阵求快速幂
Mat operator^(Mat a, int n)
{
    Mat ans = E, q = a;
    for (; n; n>>=1)
    {
        if (n&1)
            ans = ans*q;
        q = q*q;
    }
    return ans;
}
//求S = A^1 + A^2 + A^3 + … + A^n
Mat solve(Mat a, int n)
{
    if (n==1)
        return a;
     /*如果p为奇数，则对p-1进行二分，a^p+二分结果*/   
     /* 
          A^1+A^2+A^3+A^4+A^5+A^6+A^7 = (A^1+A^2+A^3)+ A^3*(A^1+A^2+A^3)+A^7=A^7+solve(A,p-1) 
     */ 
    if (n&1)
        return (a^n) + solve(a, n-1);
     /*p为偶数，则直接二分*/  
     /* 
     A^1+A^2+A^3+A^4+A^5+A^6 = (A^1+A^2+A^3)+ A^3*(A^1+A^2+A^3) = (A^3+e)*(A^1+A^2+A^3) 
     推广即可得到当p为偶数时   A^1+A^2+A^3+……+A^p = (A^(p/2)+e) * solve(A,p/2); 
     */ 
    else
        return ((a^(n>>1))+E)*solve(a, n>>1);
}
int main()
{
    return 0;
}