poj 3238

最新推荐文章于 2025-04-13 00:05:50 发布

cqwelly

最新推荐文章于 2025-04-13 00:05:50 发布

阅读量817

点赞数

分类专栏：数论搜索文章标签： POJ 矩阵 DFS numbers 算法

本文链接：https://blog.youkuaiyun.com/bani_love/article/details/9795783

版权

搜索同时被 2 个专栏收录

5 篇文章

订阅专栏

数论

2 篇文章

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 33
using namespace std;
int n, a[N][N], tmp[N][N], MOD, tp[N][N], one[N][N], ans[N][N], ta[N][N], i, j, k;
void pow_matrix( int b[N][N], int tn )
{
    for( i = 0; i < n; i++ )
    for( int j =0 ; j <n; j ++ )
    {
        tp[i][j] = one[i][j];
        tmp[i][j] = a[i][j];
    }
    while( tn )
    {
        if( tn&1 )
        {
            for( int i = 0; i < n; i ++ )
            for( int j = 0; j < n; j ++ )
            {
                ta[i][j] = 0;
                for( k = 0; k < n; k ++ )
                ta[i][j] = (ta[i][j] +tp[i][k]*tmp[k][j])%MOD;
            }
            for( i = 0; i < n; i ++ )
            for( j = 0; j < n; j ++ )
            tp[i][j] = ta[i][j];
        }
        for(i = 0; i < n; i ++ )
        for(j = 0; j < n; j ++ )
        {
            ta[i][j] = 0;
            for( k = 0; k < n; k ++ )
            ta[i][j] =(ta[i][j] +tmp[i][k]*tmp[k][j])%MOD;
        }
        for( i = 0; i < n; i ++ )
            for(j = 0; j < n; j ++ )
                tmp[i][j] = ta[i][j];
        tn>>=1;
    }
    for( int i = 0; i < n; i ++ )
        for( int j = 0; j < n; j ++ )
            b[i][j] = tp[i][j];
}

void dfs( int tn )
{
    if( tn == 1 )
    {
        for( i = 0; i < n; i ++ )
        for( j = 0; j < n; j ++ )
        ans[i][j] = a[i][j];
        return ;
    }
    else dfs( tn/2 );

    pow_matrix(tmp,tn/2);
    for( i = 0; i < n; i ++ )
    for( j = 0; j < n; j ++ )
    {
        ta[i][j] = 0;
        for( k = 0; k < n; k ++ )
        ta[i][j]= (ta[i][j]+ ans[i][k]*tmp[k][j])%MOD;
    }
    for( i = 0; i < n; i ++ )
    for( j = 0; j < n; j ++ )
        ans[i][j] = (ans[i][j]+ta[i][j])%MOD;

    if( tn&1 )
    {
        pow_matrix(tmp,tn);
        for( i = 0; i< n; i ++ )
        for( j = 0; j < n; j ++ )
        ans[i][j] = (ans[i][j]+tmp[i][j])%MOD;
    }
}

int main()
{
    int tk;
    memset(one,0,sizeof(one));
    for( i = 0; i <= 30; i ++ ) one[i][i] = 1;
    while( scanf("%d%d%d",&n,&tk,&MOD) !=EOF )
    {
        for( i = 0; i <n; i ++ )
        for( int j = 0; j < n; j ++ )
        {
            scanf("%d",&a[i][j]);
            a[i][j]%=MOD;
        }
        dfs(tk);
        for( i = 0; i < n; i ++ )
        {
            for( int j = 0; j < n-1; j ++ )
                printf("%d ",ans[i][j]);
            printf("%d\n",ans[i][n-1]);
        }
    }
    return 0;
}