UVA 11149.Power of Matrix-矩阵快速幂倍增

Power of Matrix

UVA - 11149

 

 

 

代码:

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 #define maxn 44
 #define mod 10
 int n;
 struct matrix{
     int f[maxn][maxn];
 };
 matrix sum(matrix a,matrix b){
     int i,j;
     matrix s;
     for(i=;i<n;i++)
         for(j=;j<n;j++)
             s.f[i][j]=(a.f[i][j]+b.f[i][j])%mod;
     return s;
 }
 matrix mul(matrix a,matrix b){
     int i,j,k;
     matrix s;
     memset(s.f,,sizeof(s.f));
     for(i=;i<n;i++)
         for(j=;j<n;j++)
             for(k=;k<n;k++)
             s.f[i][j]=(s.f[i][j]+a.f[i][k]*b.f[k][j])%mod;
     return s;
 }
 matrix pows(matrix e,int b){
     matrix s,a;
     int i,j,k;
     a=e;
     for(i=;i<n;i++)
         for(j=;j<n;j++)
         if(i==j)s.f[i][j]=;
         else s.f[i][j]=;
     while(b){
         if(b&)
             s=mul(s,a);
         a=mul(a,a);
         b=b>>;
     }
     return s;
 }
 matrix work(matrix e,int k){
     matrix s,a,b;
     if(k==)
         return e;
     a=work(e,k/);
     s=sum(a,mul(a,pows(e,k/)));
     if(k&)
         s=sum(s,pows(e,k));
     return s;
 }
 int main(){
     int k;
     while( cin>>n>>k){
         if(n==)
             break;
         int i,j,a;
         matrix e;
         for(i=;i<n;i++)
         {
             for(j=;j<n;j++)
             {
                 cin>>a;
                 e.f[i][j]=a%;
             }
         }
         e=work(e,k);
         for(i=;i<n;i++)
         {
             cout<<e.f[i][];
             for(j=;j<n;j++)
                 cout<<" "<<e.f[i][j];
             cout<<endl;
         }
         cout<<endl;
     }
     return ;
 }