练习37
来源:互联网 发布:sql中出现次数最多的 编辑:程序博客网 时间:2024/05/24 06:16
#include <iostream>
using namespace std;
void swap(int& a, int&b) {
int temp = a;
a = b;
b = temp;
}
int main()
{
int a[3][3];
cout << "输入9个整数作为矩阵元素值" << endl;
for (int i = 0; i < 3; i ++)
for (int j = 0; j < 3; j ++)
cin >> a[i][j];
cout << "初始矩阵:" << endl;
for (int i = 0; i < 3; i ++) {
for (int j = 0; j < 3; j ++)
cout << a[i][j] << ' ';
cout << endl;
}
for (int i = 0; i < 3; i ++)
for (int j = 0; j < i; j ++)
swap(a[i][j], a[j][i]);
for (int i = 0; i < 3; i ++) {
for (int j = 0; j < 3; j ++)
cout << a[i][j] << ' ';
cout << endl;
}
return 0;
}
using namespace std;
void swap(int& a, int&b) {
int temp = a;
a = b;
b = temp;
}
int main()
{
int a[3][3];
cout << "输入9个整数作为矩阵元素值" << endl;
for (int i = 0; i < 3; i ++)
for (int j = 0; j < 3; j ++)
cin >> a[i][j];
cout << "初始矩阵:" << endl;
for (int i = 0; i < 3; i ++) {
for (int j = 0; j < 3; j ++)
cout << a[i][j] << ' ';
cout << endl;
}
for (int i = 0; i < 3; i ++)
for (int j = 0; j < i; j ++)
swap(a[i][j], a[j][i]);
for (int i = 0; i < 3; i ++) {
for (int j = 0; j < 3; j ++)
cout << a[i][j] << ' ';
cout << endl;
}
return 0;
}
阅读全文
0 0
- 练习37
- 练习37
- 【SICP练习】37 练习1.42
- Python 练习实例37
- leetCode练习(37)
- 练习
- “++”“--”练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- 练习
- Math,Date.Numbr
- 练习36
- 不相关性和独立性
- 51Nod-1082 与7无关的数【进制+打表】
- Codeforces 811D Vladik and Favorite Game[模拟][bfs]
- 练习37
- CSU
- 关于ionic 降级版本操作
- 练习38
- java web 创建举例
- Android 自定义View (二) 进阶
- 我将进化成一条狗(11)——工业机器人
- 负熵作为非高斯的度量
- 于CentOS7.2配置ISCSI-targetcli---Linux