矩阵

无聊写了个矩阵的模板，传上备用。

#include <stdio.h>
#include <string.h>

typedef __int64 LL;

#define N 32

int mod;

struct Matrix
{
    int r,c;
    int m[N][N];
    Matrix(){}
    Matrix(int r,int c):r(r),c(c){}
    Matrix operator *(const Matrix& B)
    {
        Matrix T(r,B.c);
        for(int i=1;i<=T.r;i++)
        {
            for(int j=1;j<=T.c;j++)
            {
                int tt = 0;
                for(int k=1;k<=c;k++)
                    tt += m[i][k]*B.m[k][j] % mod;
                T.m[i][j] = tt % mod;
            }
        }
        return T;
    }
    Matrix operator +(const Matrix& B)
    {
        Matrix T(r,c);
        for(int i=1;i<=r;i++)
            for(int j=1;j<=c;j++)
                T.m[i][j] = (m[i][j]+B.m[i][j]) % mod;
        return T;
    }
    Matrix Unit()
    {
        Matrix T(r,r);
        memset(T.m,0,sizeof(T.m));
        for(int i=1;i<=r;i++)
            T.m[i][i] = 1;
        return T;
    }
    Matrix Pow(int n)
    {
        Matrix P(*this) ,Res = Unit();
        while(n)
        {
            if(n&1)
                Res = Res*P;
            P = P*P;
            n >>= 1;
        }
        return Res;
    }
    void Init()
    {
        int h;
        scanf("%d%d",&h,&mod);
        r = c = h;
        for(int i=1;i<=r;i++)
            for(int j=1;j<=c;j++)
                scanf("%d",&m[i][j]);
    }
    void Print()
    {
        for(int i=1;i<=r;i++)
        {
            for(int j=1;j<=c;j++)
                printf("%d ",m[i][j]);
            printf("\n");
        }
    }
};

Matrix PreSum(Matrix A,int k)
{
    if(k == 1)
        return A;
    Matrix Sum = PreSum(A,k/2);
    if(k&1)
    {
        Matrix Ak_1 = A.Pow(k/2+1);
        return Sum + Ak_1 + Ak_1*Sum;
    }
    else
    {
        Matrix Ak = A.Pow(k/2);
        return Sum + Ak*Sum;
    }
}