Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
127827 | 饶晋吉 | 矩阵右移动 | C++ | Accepted | 1 MS | 268 KB | 505 | 2025-07-29 14:28:19 |
#include<bits/stdc++.h> using namespace std; int main() { int n, m; cin >> m >> n; int q[n][n]; int w[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> q[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int steps = (j + m) % n; w[i][steps] = q[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << w[i][j] << " "; } if (i != n - 1) { cout << endl; } } return 0; }