hdu 1757 矩阵快速幂

首先构造矩阵：

我的代码中用的并非此矩阵，而是另外一种形式 不过是一样的效果

AC代码如下：

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

int num[11];
int N, MOD;

void multipy( int a[][11], int b[][11], int c[][11] ){
    for( int i = 1; i <= 10; i++ ){
        for( int j = 1; j <= 10; j++ ){
            c[i][j] = 0;
            for( int k = 1; k <= 10; k++ ){
                c[i][j] = ( c[i][j] + a[i][k] * b[k][j] ) % MOD;
            }
        }
    }
}

void get_matrix_pow( int a[][11], int n ){
    int ans[11][11] = {0};
    int temp[11][11];
    for( int i = 1; i <= 10; i++ )  ans[i][i] = 1;

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

int main(){
    while( scanf( "%d%d", &N, &MOD ) != EOF ){
        for( int i = 1; i <= 10; i++ ){
            scanf( "%d", num + i );
        }
        if( N < 10 ){
            printf( "%d\n", N );
        }else{
            int a[11][11] = {0};
            for( int i = 1; i <= 9; i++ ){
                a[i][i+1] = 1;
            }
            for( int i = 1; i <= 10; i++ ){
                a[10][i] = num[10-i+1];
            }
            get_matrix_pow( a, N - 9 );
            int ans = 0;
            for( int i = 1; i <= 10; i++ ){
                ans = ( ans + a[10][i] * ( i - 1 ) ) % MOD;
            }
            printf( "%d\n", ans );
        }
    }
    return 0;
}