Power of Matrix UVA - 11149 （矩阵快速幂 矩阵前k次方之和）

题目描述：输入一个矩阵，输出其前k项次方之和。

思路：矩阵的n次方用矩阵快速幂写，当k为偶数时，A + A^2 + A^3 + ... + A^k = A + A^2 + ... + A^(k/2) + A^(k/2) * ( A + A^2 + ... + A^(k/2) ) = (E + A^(k/2) ) * ( A + A^2 + ... + A^(k/2) )，当k为奇数时，A + A^2 + A^3 + ... + A^k = A + A^2 + ... + A^(k/2) + A^(k/2)( A + A^2 + ... + A^(k/2) ) + A^k，利用这个公式可以递归求解答案。每组样例最后输出一个空行，不过比较坑的地方是，输入不是0,0结束，而是n为0时结束，当n不为0但是k为0是应该输出一个空行，否则会一直PE。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<sstream>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int  maxn = 40 + 5;
const int mod = 10;
const int dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
const int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const int Dis[] = {-1, 1, -5, 5};
const double inf = 0x3f3f3f3f;
int n, m, k;
struct Matrix{
    int a[maxn][maxn];
    int row, col;
    void init(int r, int c){
        row = r; col = c;
    }
    Matrix operator * (const Matrix &ma) const{
        Matrix ans;
        ans.init(row, col);
        for(int i = 0; i < row; ++i){
            for(int j = 0; j < ma.row; ++j){
                ans.a[i][j] = 0;
                for(int k = 0; k < col; ++k){
                    ans.a[i][j] = (ans.a[i][j] + (a[i][k] * ma.a[k][j]) % mod) % mod;
                }
            }
        }
        return ans;
    }

    Matrix operator + (const Matrix &mat) const{
        Matrix ans;
        ans.init(row, col);
        for(int i = 0; i < row; ++i){
            for(int j = 0; j < col; ++j){
                ans.a[i][j] = (a[i][j] + mat.a[i][j]) % mod;
            }
        }
        return ans;
    }
}E;
Matrix quick_pow(Matrix mat, int x){
    if(x == 1) return mat;
    Matrix ans = E;
    while(x){
        if(x & 1) ans = ans * mat;
        mat = mat * mat;
        x >>= 1;
    }
    return ans;
}
Matrix solve(Matrix mat, const int k){
    if(k == 1){
        return mat;
    }
    Matrix ans; ans.init(mat.row, mat.col);
    Matrix tmp = quick_pow(mat, k / 2);
    tmp = tmp + E;
    ans = tmp  * solve(mat, k / 2);
    if(k & 1) ans = ans + quick_pow(mat, k);
    return ans;
}
int main(){
    while(~scanf("%d%d", &n, &k) && n){
        Matrix mat;
        mat.row = mat.col = n;
        E.row = E.col = n;
        for(int i = 0; i < n; ++i) E.a[i][i] = 1;

        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                scanf("%d", &mat.a[i][j]);
                mat.a[i][j] %= 10;
            }
        }
        if(k == 0){
            printf("\n"); continue;
        }
        Matrix ans = solve(mat, k);
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                if(j) printf(" ");
                printf("%d", ans.a[i][j]);
            }
            printf("\n");
        }
        printf("\n");
    }
    return 0;
}