hdu 1575 矩阵快速幂

应用矩阵快速幂之后求和即可

AC代码如下：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX_N = 11;
const int MOD = 9973;

int N, M;

void multipy( int a[MAX_N][MAX_N], int am, int an, int b[ MAX_N][MAX_N], int bm, int bn, int c[MAX_N][MAX_N] ){
    for( int i = 1; i <= am; i++ ){
        for( int j = 1; j <= bn; j++ ){
            c[i][j] = 0;
            for( int k = 1; k <= an; k++ ){
                c[i][j] = ( c[i][j] + a[i][k] * b[k][j] ) % MOD;
            }
        }
    }
}

void get_matrix_pow( int a[MAX_N][MAX_N], int n ){
    int ans[MAX_N][MAX_N] = {0};
    int temp[MAX_N][MAX_N];

    for( int i = 1; i <= N; i++ ){
        ans[i][i] = 1;
    }

    while( n ){
        if( n % 2 == 1 ){
            multipy( ans, N, N, a, N, N, temp );
            memcpy( ans, temp, sizeof( int ) * MAX_N * MAX_N );
        }
        multipy( a, N, N, a, N, N, temp );
        memcpy( a, temp, sizeof( int ) * MAX_N * MAX_N );
        n /= 2;
    }
    memcpy( a, ans, sizeof( int ) * MAX_N * MAX_N );
}

int main(){
    int T;

    scanf( "%d", &T );
    while( T-- ){
        int a[MAX_N][MAX_N];
        scanf( "%d%d", &N, &M );
        for( int i = 1; i <= N; i++ ){
            for( int j = 1; j <= N; j++ ){
                scanf( "%d", &a[i][j] );
            }
        }
        get_matrix_pow( a, M );
        int ans = 0;
        for( int i = 1; i <= N; i++ ){
            ans = ( ans + a[i][i] ) % MOD;
        }
        printf( "%d\n", ans );
    }
    return 0;
}