#include<iostream>
using namespace std;
int main() {
//可以修改下面的10为其他任意数字来矩阵能计算的最大阶数
int n, a[10][10], b[10][10], c[10][10], hang[10], lie[10], x, y, sum = 0;
cout << "输入该矩阵的阶数n:" << endl;
cin >> n;
cout << "请输入这两个矩阵" << endl<<endl << "第一个矩阵:" << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
cout << "第二个矩阵:" ;
cout << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> b[i][j];
}
}
cout << endl;
//主要算法是:每次选定第一个矩阵的第一行和第二个矩阵的第一列分别相乘相加作为第三个矩阵的元素,之后输出第三个矩阵
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (x = 0; x < n; x++) {
hang[x] = a[i][x];
lie[x] = b[x][j];
}
for (y = 0; y < n; y++) {
sum += hang[y] * lie[y];
}
c[i][j] = sum;
sum = 0;
}
}
cout << "两个矩阵相乘结果:" << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << c[i][j] << " ";
}
cout << endl;
}
return 0;
}
做完之后,可以用来快速计算3阶以上的矩阵,方便大家算线性代数~~