n, m = map(int, input().split())
matrix = []
for i in range(n):
matrix.append(list(map(int, input().split())))
rotated = [[0] * n for _ in range(m)]
for i in range(n):
for j in range(m):
rotated[m-j-1][i] = matrix[i][j]
for row in rotated:
print(*row)
这题主打的就是一个矩阵翻转,当然实际操作的过程中我们也可以跳过rotated直接输出
n, m = map(int, input().split())
matrix = []
for i in range(n):
matrix.append(list(map(int, input().split())))
for i in range(m):
for j in range(n):
print(matrix[n-j-1][i], sep=' ')
print()
像这样,但是这却通过不了csp,我也没搞清楚按原因,如果有人知道为什么可以告诉我