POJ 3233 Matrix Power Series

来源：互联网发布：国家中级程序员证书编辑：程序博客网时间：2024/06/08 17:33
////  main.cpp//  Richard////  Created by 邵金杰 on 16/7/29.//  Copyright © 2016年 邵金杰. All rights reserved.//#include<cstdio>#include<cstring>using namespace std;int n,k,p;typedef struct node{    int a[32][32];    void make(){        memset(a,0,sizeof(a));        for(int i=0;i<n;i++) a[i][i]=1;    }}Mat;Mat operator * (Mat a,Mat b){    Mat c;    memset(c.a,0,sizeof(c.a));    for(int k=0;k<n;k++)    {        for(int i=0;i<n;i++)        {            for(int j=0;j<n;j++)            {                c.a[i][j]=(c.a[i][j]+a.a[i][k]*b.a[k][j])%p;            }        }    }    return c;}Mat operator + (Mat a,int x){    Mat b;    memset(b.a,0,sizeof(b.a));    for(int i=0;i<n;i++) b.a[i][i]=x;    for(int i=0;i<n;i++)    {        for(int j=0;j<n;j++)        {            a.a[i][j]=(a.a[i][j]+b.a[i][j])%p;        }    }    return a;}Mat operator + (Mat a,Mat b){    Mat c;    memset(c.a,0,sizeof(c.a));    for(int i=0;i<n;i++)    {        for(int j=0;j<n;j++)        {            c.a[i][j]=(a.a[i][j]+b.a[i][j])%p;        }    }    return c;}Mat Multiply(Mat a,int h){    Mat result;    Mat base=a;    result.make();    while(h)    {        if(h&1) result=result*base;        base=base*base;        h=(h>>1);    }    return result;}Mat PowSumMod(Mat Matrix,int h){    if(h==1){        Mat q;        q.make();        return q*Matrix;    }    else if(h%2==0){        return (Multiply(Matrix,h/2)+1)*PowSumMod(Matrix,h/2);    }    else        return ((Multiply(Matrix,(h-1)/2)+1)*PowSumMod(Matrix,(h-1)/2))+Multiply(Matrix,h);}int main(){    Mat Matrix;    Mat result;    scanf("%d%d%d",&n,&k,&p);    for(int i=0;i<n;i++)    {        for(int j=0;j<n;j++)        {            scanf("%d",&Matrix.a[i][j]);            Matrix.a[i][j]=(Matrix.a[i][j])%p;        }    }    result=PowSumMod(Matrix,k);    for(int i=0;i<n;i++)    {        for(int j=0;j<n;j++)        {            printf("%d ",result.a[i][j]);        }        printf("\n");    }    return 0;}
0 0