蓝桥杯 矩阵乘法 模拟

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int N = 210;
 4 int a[N][N], b[N][N], c[N][N];
 5 int main() {
 6     int m, s, n;
 7     cin >> m >> s >> n;
 8     for (int i = 0; i < m; i++) {
 9         for (int j = 0; j < s; j++) {
10             cin >> a[i][j];
11         }
12     }
13     for (int i = 0; i < s; i++) {
14         for (int j = 0; j < n; j++) {
15             cin >> b[i][j];
16         }
17     }
18     for (int i = 0; i < m; i++) {
19         for (int j = 0; j < n; j++) {
20             for (int k = 0; k < s; k++) {
21                 c[i][j] += a[i][k] * b[k][j];
22             }
23         }
24     }
25     for (int i = 0; i < m; i++) {
26         for (int j = 0; j < n; j++) {
27             cout << c[i][j] << " ";
28         }
29         cout << endl;
30     }
31     return 0;
32 }