矩阵基础1007 UVA 11149

题意:
给一个矩阵A和K,求出A^1+A^2+….A^k
思路:
用倍增法来把时间复杂度降低到log(k)*n^3
F(5)=A^1+A^2+A^3+A^4+A^5=F(2)*(E+A^2)+A^5(E是单位矩阵
F(n)=F(n/2)*(E*A^(k/2))+n%2?A^k:0;

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x&(-x))
typedef long long LL;
const int maxn = 100005;
const int inf=(1<<28)-1;
#define Matrix_Size 45
const LL MOD = 10;
int Size;
struct Matrix
{
    LL mat[Matrix_Size][Matrix_Size];
    void clear()
    {
        memset(mat,0,sizeof(mat));
    }
    void output()
    {
        for(int i = 0;i < Size;i++)
        {
            for(int j = 0;j < Size;j++)
            {
                if(j) printf(" ");
                printf("%lld",mat[i][j]);
            }
            printf("\n");
        }
        printf("\n");
    }
    Matrix operator *(const Matrix &b)const
    {
        Matrix ret;
        for(int i = 0;i < Size;i++)
            for(int j = 0;j < Size;j++)
            {
                ret.mat[i][j] = 0;
                for(int k = 0;k < Size;k++)
                {
                    long long tmp = (long long)mat[i][k]*b.mat[k][j]%MOD;
                    ret.mat[i][j] = (ret.mat[i][j]+tmp);
                    if(ret.mat[i][j]>= MOD)
                        ret.mat[i][j] -= MOD;
                    if(ret.mat[i][j]<0)//注意是否需要MOD 
                        ret.mat[i][j] += MOD;
                }
            }
        return ret;
    }
    Matrix operator +(const Matrix &b)const
    {
        Matrix ret;
        for(int i=0;i<Size;++i)
        {
            for(int j=0;j<Size;++j)
                ret.mat[i][j]=(mat[i][j]+b.mat[i][j])%MOD;
        }
        return ret;
    }
};
Matrix pow_M(Matrix a,long long n)
{
    Matrix ret;
    ret.clear();
    for(int i = 0;i < Size;i++)
        ret.mat[i][i] = 1;
    Matrix tmp = a;
    while(n)
    {
        if(n&1)ret = ret*tmp;
        tmp = tmp*tmp;
        n>>=1;
    }
    return ret;
}

Matrix E;

Matrix Solve(Matrix A,LL k)
{
    if(k==0) return E;
    if(k==1) return A;
    Matrix res=Solve(A,k/2),tmp;
    //res=res*(E+dfs(A,k/2));
    tmp=pow_M(A,k/2)+E;
    res=res*tmp;
    if(k&1)
        res=res+pow_M(A,k);
    return res;
}

int main()
{
    LL n,k;
    while(~scanf("%lld%lld",&n,&k)&&n)
    {
        Matrix A;
        A.clear();
        Size=n;
        for(int i=0;i<n;++i)
         for(int j=0;j<n;++j)
        {
            scanf("%lld",&A.mat[i][j]);
            A.mat[i][j]%=MOD;
        }
        E.clear();
        for(int i=0;i<Size;++i)
            E.mat[i][i]=1;
        A=Solve(A,k);
        A.output();
    }
    return 0;
}