编写一个 C++ 程序,通过示例执行矩阵算术运算。在此矩阵算术运算示例中,我们允许用户输入矩阵的大小和矩阵元素。接下来,我们使用 C++ 嵌套 for 循环遍历从 0 到行和列的矩阵。
在嵌套 for 循环中,我们对两个矩阵执行加法、除法、减法、乘法和模运算等算术运算,并将它们分配给新矩阵。最后,我们使用另一个嵌套 for 循环打印矩阵元素。
#include<iostream>
using namespace std;
int main()
{
int i, j, rows, columns;
cout << "\nPlease Enter the rows and Columns of a Multi-Dimensional Array = ";
cin >> i >> j;
int arr1[i][j], arr2[i][j], add[i][j], sub[i][j], mul[i][j], mod[i][j];
float div[i][j];
cout << "\nPlease Enter the First Multi-Dimensional Array Items = ";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < i; columns++) {
cin >> arr1[rows][columns];
}
}
cout << "\nPlease Enter the Second Multi-Dimensional Array Items = ";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < i; columns++) {
cin >> arr2[rows][columns];
}
}
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < j; columns++) {
add[rows][columns] = arr1[rows][columns] + arr2[rows][columns];
sub[rows][columns] = arr1[rows][columns] - arr2[rows][columns];
mul[rows][columns] = arr1[rows][columns] * arr2[rows][columns];
mod[rows][columns] = arr1[rows][columns] / arr2[rows][columns];
}
}
cout << "\nAdd\t Sub\t Mul\t Div\tMod \n";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < j; columns++) {
cout << add[rows][columns] << "\t";
cout << sub[rows][columns] << "\t";
cout << mul[rows][columns] << "\t";
cout << mod[rows][columns] << "\t";
cout << div[rows][columns] << "\t\n";
}
}
return 0;
}

C++ 程序执行矩阵算术运算示例 2
此矩阵算术运算 程序 与上述相同。这里,我们使用 cout 语句通过行和列迭代显示嵌套 for 循环的结果。
#include<iostream>
using namespace std;
int main()
{
int i, j, rows, columns;
cout << "\nPlease Enter the rows and Columns of a Multi-Dimensional Array = ";
cin >> i >> j;
int arr1[i][j], arr2[i][j], add[i][j], sub[i][j], mul[i][j], mod[i][j];
float div[i][j];
cout << "\nPlease Enter the First Multi-Dimensional Array Items = ";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < i; columns++) {
cin >> arr1[rows][columns];
}
}
cout << "\nPlease Enter the Second Multi-Dimensional Array Items = ";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < i; columns++) {
cin >> arr2[rows][columns];
}
}
for(rows = 0; rows < i; rows++) {
cout << "\nThe Result of the " << rows + 1 << " Row Iteration\n";
for(columns = 0; columns < j; columns++) {
add[rows][columns] = arr1[rows][columns] + arr2[rows][columns];
sub[rows][columns] = arr1[rows][columns] - arr2[rows][columns];
mul[rows][columns] = arr1[rows][columns] * arr2[rows][columns];
mod[rows][columns] = arr1[rows][columns] / arr2[rows][columns];
div[rows][columns] = arr1[rows][columns] % arr2[rows][columns];
cout << "\nThe Result of the " << columns + 1 << " Column Iteration\n";
cout << arr1[rows][columns] << " + " << arr2[rows][columns] << " = " << add[rows][columns] << "\n";
cout << arr1[rows][columns] << " - " << arr2[rows][columns] << " = " << sub[rows][columns] << "\n";
cout << arr1[rows][columns] << " * " << arr2[rows][columns] << " = " << mul[rows][columns] << "\n";
cout << arr1[rows][columns] << " / " << arr2[rows][columns] << " = " << mod[rows][columns] << "\n";
cout << arr1[rows][columns] << " % " << arr2[rows][columns] << " = " << div[rows][columns] << "\n";
}
}
cout << "\nAdd\t Sub\t Mul\t Div\tMod \n";
for(rows = 0; rows < i; rows++) {
for(columns = 0; columns < j; columns++) {
cout << add[rows][columns] << "\t";
cout << sub[rows][columns] << "\t";
cout << mul[rows][columns] << "\t";
cout << mod[rows][columns] << "\t";
cout << div[rows][columns] << "\t\n";
}
}
return 0;
}
Please Enter the rows and Columns of a Multi-Dimensional Array = 2 2
Please Enter the First Multi-Dimensional Array Items =
10 20
30 40
Please Enter the Second Multi-Dimensional Array Items =
15 9
22 50
The Result of the 1 Row Iteration
The Result of the 1 Column Iteration
10 + 15 = 25
10 - 15 = -5
10 * 15 = 150
10 / 15 = 0
10 % 15 = 10
The Result of the 2 Column Iteration
20 + 9 = 29
20 - 9 = 11
20 * 9 = 180
20 / 9 = 2
20 % 9 = 2
The Result of the 2 Row Iteration
The Result of the 1 Column Iteration
30 + 22 = 52
30 - 22 = 8
30 * 22 = 660
30 / 22 = 1
30 % 22 = 8
The Result of the 2 Column Iteration
40 + 50 = 90
40 - 50 = -10
40 * 50 = 2000
40 / 50 = 0
40 % 50 = 40
Add Sub Mul Div Mod
25 -5 150 0 10
29 11 180 2 2
52 8 660 1 8
90 -10 2000 0 40