L1-048 矩阵A乘以B (15 分)

学过线性代数的话有手就行·····

题目

输入样例1：

2 3
1 2 3
4 5 6
3 4
7 8 9 0
-1 -2 -3 -4
5 6 7 8

输出样例1：

2 4
20 22 24 16
53 58 63 28

输入样例2：

3 2
38 26
43 -5
0 17
3 2
-11 57
99 68
81 72

输出样例2：

Error: 2 != 3

AC代码

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define pre(i,a,b) for(int i=a;i>=b;--i)
#define m(x) memset(x,0,sizeof x)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI acos(-1)
typedef long long ll;
const int INF =  0x3f3f3f3f;
const int mod = 1e9+7;
const int maxn = 1e2+10;
int ma[maxn][maxn],mb[maxn][maxn];
int ans[maxn][maxn];
int main()
{
    int an,am,bn,bm;
    cin >> an >> am;
    rep(i, 1, an)
    rep(j, 1, am)
    cin >> ma[i][j];
    
    cin >> bn >> bm;
    rep(i, 1, bn)
    rep(j, 1, bm)
    cin >> mb[i][j];
    
    if(am!=bn)printf("Error: %d != %d\n",am,bn);
    else{
        rep(i, 1, an)
        rep(j, 1, bm){
        rep(k,1,am)
            ans[i][j] += mb[k][j]*ma[i][k];
        }
        cout << an << " " << bm << endl;
        rep(i, 1, an)
        rep(j, 1, bm)
        {
            if(j!=bm)printf("%d ",ans[i][j]);
            else printf("%d\n",ans[i][j]);
        }
    }
    return 0;
}