提交时间:2023-09-11 22:28:52

运行 ID: 101973

#include <iostream> #include <algorithm> #include <map> using namespace std; typedef long long LL; int n, m, a[110][110]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int j = 1; j <= m; j++) for (int i = 1; i <= n; i++) cout << a[i][j] << " \n"[i == n]; return 0; }