矩阵的模板----

矩阵是一个很好的工具，

参考别人到博客：http://mindlee.net/2011/11/21/matrix-multiply/

经典矩阵相乘10题，大牛博客 http://www.matrix67.com/blog/archives/276/

/*
矩阵的运用很宽泛
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#define N 100
#define mod 10000007
using namespace std;

struct Matrix
{
    int mat[N][N];
}M_hxl,M_tom;


void Matrix_ini(Matrix *cur,int len)
{
    int i,j;
    for(i=1;i<=len;i++)
    for(j=1;j<=len;j++)
    if(i==j)
    cur->mat[i][j]=1;
    else
    cur->mat[i][j]=0;
}

 Matrix Multiply(Matrix cur,Matrix now,int len)//矩阵相乘
{
    Matrix ww;
    int i,j,k;
    memset(ww.mat,0,sizeof(ww.mat));
    for(i=1;i<=len;i++)
    for(k=1;k<=len;k++)
    if(cur.mat[i][k])
    {
        for(j=1;j<=len;j++)
        if(now.mat[k][j])
        {
            ww.mat[i][j]+=cur.mat[i][k]*now.mat[k][j];
            if(ww.mat[i][j]>=mod)
            ww.mat[i][j]%=mod;
        }
    }
    return ww;
}

struct Matrix M_add(Matrix cur,Matrix now,int len)//矩阵相加
{
    Matrix ww;
    int i,j;
    memset(ww.mat,0,sizeof(ww.mat));

    for(i=1;i<=len;i++)
    for(j=1;j<=len;j++)
    {
        ww.mat[i][j]=cur.mat[i][j]+now.mat[i][j];
        if(ww.mat[i][j]>=mod)
        ww.mat[i][j]%=mod;
    }
    return ww;
}

Matrix pow_sum1(Matrix cur,int n,int len)//矩阵快速幂
{
    Matrix ww;
    Matrix_ini(&ww,len);
    while(n)
    {
        if(n&1)
        {
            ww=Multiply(ww,cur,len);
        }
        n=n>>1;
        cur=Multiply(cur,cur,len);
    }
    return ww;
}

Matrix pow_sum2(Matrix cur,int n,int len)//A^1+A^2+A^3+A^4....
{
    int zhan[64],zlen=0,i;
    Matrix tp1,tp2=cur,ret;
    Matrix_ini(&ret,len);
    while(n)
    {
        zhan[++zlen]=n&1;
        n=n>>1;
    }
    for(i=zlen-1;i>=1;i--)
    {
        tp1=Multiply(tp1,M_add(tp2,ret,len),len);
        tp2=Multiply(tp2,tp2,len);
        if(zhan[i])
        {
            tp2=Multiply(tp2,cur,len);
            tp1=M_add(tp2,tp1,len);
        }
    }
    return tp1;
}

int main()
{
}