矩阵乘法模板

最新推荐文章于 2024-06-06 22:30:25 发布

weixin_30664615

最新推荐文章于 2024-06-06 22:30:25 发布

阅读量58

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/get-an-AC-everyday/p/4835054.html

#include<bits/stdc++.h>
using namespace std;
int mod ;

struct Matrix {
        int n , m ;
        int mat[4][4] ;
        int * operator [] (int x) {
               return mat[x] ;
        }
} ;

Matrix operator * (Matrix &x , Matrix &y) {
       Matrix res ;
       res.n = x.n , res.m = y.m ;
       memset (res.mat , 0 , sizeof(res.mat) ) ;
       for (int i = 0 ; i < x.n ; i ++) {
               for (int j = 0 ; j < y.m ; j ++) {
                       for (int k = 0 ; k < x.m ; k ++) {
                               int tmp = (int) (1ll*x[i][k] * y[k][j] % mod ) ;
                               res[i][j] = (res[i][j] + tmp) % mod ;
                       }
               }
       }
       return res ;
}

int main () {
        Matrix x , y ;
        x = {2 , 2 , {{1 , 0} , {2, 3}} } ;
        y = {2 , 2 , {{2 , 1} , {3, 4}} } ;
        mod = 1000 ;
        Matrix z = x * y ; 
        for (int i = 0 ; i < 2 ; i ++) {
                for (int j = 0 ; j < 2 ; j++) {
                        cout << z[i][j] << " " ;
                } cout << endl ;
        }
        return 0 ;
}

转载于:https://www.cnblogs.com/get-an-AC-everyday/p/4835054.html