POJ-3233-Matrix Power Series

最新推荐文章于 2020-12-19 11:24:01 发布

Helium_wild

最新推荐文章于 2020-12-19 11:24:01 发布

阅读量195

点赞数

分类专栏：数学==矩阵

本文链接：https://blog.csdn.net/qq_42576687/article/details/87210834

版权

数学==矩阵专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题目传送门
Description

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

在这里插入图片描述

#include<cstdio>
#include<cstring>
#define m(a,b) memset(a,b,sizeof a)
using namespace std;
typedef long long ll;
const int N=100;
struct mat{ll a[N][N];};
ll n,mod,p;
mat c;
mat mat_mul(mat x,mat y)
{
    mat res;
    m(res.a,0);
    for(int i=1;i<=2*n;i++)
        for(int j=1;j<=2*n;j++)
            for(int k=1;k<=2*n;k++)
                res.a[i][j]=(res.a[i][j]+(x.a[i][k]*y.a[k][j])%mod)%mod;
    return res;
}
void mat_pow(int p)
{
    mat res,tmp=c;
    m(res.a,0);
    for(int i=1;i<=2*n;i++)
        res.a[i][i]=1;
    while(p)
    {
        if(p&1)
            res=mat_mul(res,c);
        c=mat_mul(c,c);
        p>>=1;
    }
    mat ans;
    m(ans.a,0);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            for(int k=1;k<=2*n;k++)
                ans.a[i][j]=(ans.a[i][j]+(res.a[i][k]*tmp.a[k][j+n])%mod)%mod;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            if(j!=n)
                printf("%d ",ans.a[i][j]);
            else
                printf("%d\n",ans.a[i][j]);
        }
}
int main()
{
    while(~scanf("%lld%lld%lld",&n,&p,&mod))
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            {
                scanf("%lld",&c.a[i][j]);
                c.a[i][j]%=mod;
            }    
        for(int i=1;i<=n;i++)
            for(int j=n+1;j<=2*n;j++)
                c.a[i][j]=c.a[i][j-n];
        for(int i=n+1;i<=2*n;i++)
            c.a[i][i]=1;
        for(int i=n+1;i<=2*n;i++)
            for(int j=1;j<=n;j++)
                c.a[i][j]=0;
        mat_pow(p-1);
    }
}