找规律
#include <iostream>
using namespace std;
const int N = 1010;
int a[N][N], m, n;
int main() {
scanf("%d %d", &m, &n);
for (int y = 0; y < m; ++y)
for (int x = 0; x < n; ++x)
scanf("%d", &a[n - 1 - x][y]);
for (int y = 0; y < n; ++y) {
for (int x = 0; x < m; ++x) cout << a[y][x] << ' ';
cout << endl;
}
return 0;
}