| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 87601 | bnu_fanmeijie | 矩阵转置 | C++ | Accepted | 0 MS | 252 KB | 739 | 2026-04-22 14:45:27 |
#include <iostream> using namespace std; int main() { int n, m; cin >> n >> m; // 读取行数和列数 // 原矩阵 A[n][m] int A[105][105]; // 读取原矩阵 for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> A[i][j]; } } // 输出转置矩阵 A^T[m][n] // 转置规律:A^T[j][i] = A[i][j] for (int j = 0; j < m; j++) { // 转置矩阵的行 = 原矩阵的列 for (int i = 0; i < n; i++) { // 转置矩阵的列 = 原矩阵的行 cout << A[i][j]; if (i < n - 1) { cout << " "; } } cout << endl; } return 0; }