POJ 3233(矩阵快速幂的转化法)

传送门
Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.

Input
The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.

Output
Output the elements of S modulo m in the same way as A is given.

Sample Input
2 2 4
0 1
1 1
Sample Output
1 2
2 3

我们要先找到这个矩阵

$$\begin{array}{ccc} A & 1\\ 1 & 1 \end{array}$$

对于这个矩阵而言，他的平方是

$$\begin{array}{ccc} A^{2}& 1\\ A + 1 & 1 \end{array}$$

他的三次方为

$$\begin{array}{ccc} A^{3} & 1\\ A^{2} + A + 1 & 1 \end{array}$$

只要我们把矩阵带入这个A就可以求出S了，这里面的1都是n*n的单位矩阵，就是对角线都为1

代码如下：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>

using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
int n,k,M;

mat mul(mat &A,mat &B){//求两个矩阵相乘
    mat C(A.size(),vec(B[0].size()));
    for(int i=0;i<A.size();i++){
        for(int j=0;j<B[0].size();j++){
            for(int k=0;k<B.size();k++){
                C[i][j] = (C[i][j] + A[i][k]*B[k][j]) % M;
            }
        }
    }
    return C;
}

mat pow(mat &A,int n){//快速幂
    mat B(A.size(),vec(A.size()));
    for(int i=0;i<A.size();i++){
        B[i][i] = 1;
    }
    while(n){
        if(n &1)    B = mul(B,A);
        A = mul(A,A);
        n >>= 1;
    }
    return B;
}
int main(void){

    scanf("%d %d %d",&n,&k,&M);
    mat A(n,vec(n));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            int tem;
            scanf("%d",&tem);
            A[i][j] = tem;
        }
    }
    mat B(2*n,vec(2*n));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            B[i][j] = A[i][j];
        }
        B[n+i][i] = B[n+i][n+i] = 1;//把下面的两个小矩阵对角线置为1
    }
    B = pow(B,k+1);//注意左下角，所以是k+1
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            int a = B[n+i][j];//获得左下角的值
            if(i == j){
                a = (a -  1 + M) % M;
            }
            printf("%d ",a);
        }
        printf("\n");
    }
    return 0;
}