hdu4965 Fast Matrix Calculation 矩阵快速幂

One day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a crazy problem for her.

Bob has a six-faced dice which has numbers 0, 1, 2, 3, 4 and 5 on each face. At first, he will choose a number N (4 <= N <= 1000), and for N times, he keeps throwing his dice for K times (2 <=K <= 6) and writes down its number on the top face to make an N*K matrix A, in which each element is not less than 0 and not greater than 5. Then he does similar thing again with a bit difference: he keeps throwing his dice for N times and each time repeat it for K times to write down a K*N matrix B, in which each element is not less than 0 and not greater than 5. With the two matrix A and B formed, Alice’s task is to perform the following 4-step calculation.

Step 1: Calculate a new N*N matrix C = A*B.
Step 2: Calculate M = C^(N*N). 
Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’.
Step 4: Calculate the sum of all the elements in M’.

Bob just made this problem for kidding but he sees Alice taking it serious, so he also wonders what the answer is. And then Bob turn to you for help because he is not good at math.

矩阵快速幂

 #include<stdio.h>
 #include<string.h>
 #include<math.h>
 typedef long long ll;
 const int mod=;

 struct mat{
     int r,c;
     int m[][];        //经测试最大开成590*590的 ll 型矩阵
     mat(){}
     mat(int r,int c):r(r),c(c){}
     void clear(){
         memset(m,,sizeof(m));
     }

     mat operator+(mat a)const{
         mat ans(r,c);
         for(int i=;i<=r;i++){
             for(int j=;j<=c;j++){
                 ans.m[i][j]=(m[i][j]+a.m[i][j])%mod;
             }
         }
         return ans;
     }

     mat operator*(mat a)const{
         mat tmp(r,a.c);
         int i,j,k;
         for(i=;i<=tmp.r;i++){
             for(j=;j<=tmp.c;j++){
                 tmp.m[i][j]=;
                 for(k=;k<=c;k++){
                     tmp.m[i][j]=(tmp.m[i][j]+(m[i][k]*a.m[k][j])%mod)%mod;
                 }
             }
         }
         return tmp;
     }

     mat operator^(int n)const{        //需要时可以用 ll n，注意运算符优先级比较低，多用括号；
         mat ans(r,r),tmp(r,r);
         memcpy(tmp.m,m,sizeof(tmp.m));
         ans.clear();
         for(int i=;i<=ans.r;i++){
             ans.m[i][i]=;
         }
         while(n){
             if(n&)ans=ans*tmp;
             n>>=;
             tmp=tmp*tmp;
         }
         return ans;
     }

     void print()const{
         for(int i=;i<=r;i++){
             for(int j=;j<=c;j++){
                 printf("%d",m[i][j]);
                 if(j==c)printf("\n");
                 else printf(" ");
             }
         }
     }

 };

 int m1[][],m2[][],tmp[][],tmp2[][],tmp3[][];

 int main(){
     int n,k;
     while(scanf("%d%d",&n,&k)!=EOF&&n+k){
         int i,j,p;
         for(i=;i<=n;i++){
             for(j=;j<=k;j++)scanf("%d",&m1[i][j]);
         }
         for(i=;i<=k;i++){
             for(j=;j<=n;j++)scanf("%d",&m2[i][j]);
         }
         for(i=;i<=k;i++){
             for(j=;j<=k;j++){
                 tmp[i][j]=;
                 for(p=;p<=n;p++){
                     tmp[i][j]+=m2[i][p]*m1[p][j];
                 }
                 tmp[i][j]%=;
             }
         }
         mat a(k,k);
         memcpy(a.m,tmp,sizeof(tmp));
         a=(a^(n*n-));
         memcpy(tmp,a.m,sizeof(tmp));
         for(i=;i<=n;i++){
             for(j=;j<=k;j++){
                 tmp2[i][j]=;
                 for(p=;p<=k;p++){
                     tmp2[i][j]+=m1[i][p]*tmp[p][j];
                 }
                 tmp2[i][j]%=;
             }
         }
         for(i=;i<=n;i++){
             for(j=;j<=n;j++){
                 tmp3[i][j]=;
                 for(p=;p<=k;p++){
                     tmp3[i][j]+=tmp2[i][p]*m2[p][j];
                 }
                 tmp3[i][j]%=;
             }
         }
         int ans=;
         for(i=;i<=n;i++){
             for(j=;j<=n;j++)ans+=tmp3[i][j];
         }
         printf("%d\n",ans);
     }
     return ;
 }