| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 132137 | 徐英杰 | 矩阵旋转 | C++ | Accepted | 7 MS | 824 KB | 437 | 2025-10-06 17:31:36 |
#include <iostream> using namespace std; int a[1001][1001]; int b[1001][1001]; int n,m; int main() { cin>>n>>m; for (int i = 1;i <= n;++i) { for (int j = 1;j <= m;++j) { cin>>a[i][j]; b[j][n-i+1] = a[i][j]; } } for (int i = 1;i <= m;++i) { for (int j = 1;j <= n;++j) { cout<<b[i][j]<<" "; } cout<<endl; } return 0; }