Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
78255 冯潇阳 矩阵右移动 Python3 Wrong Answer 32 MS 3772 KB 240 2024-06-16 19:30:17

Tests(0/2):

Code:

m, n = map(int, input().split()) a = [] for i in range(n): b = list(map(int, input().split())) a.append(b) b = a print(a) for x in range(n): for y in range(n): b[x][(y + m) % (n-1)] = a[x][y] print(b)

Run Info:

------Input------

2 3
1 2 3
4 5 6
7 8 9

------Answer-----

2 3 1
5 6 4
8 9 7

------Your output-----

[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
[[3, 2, 3], [4, 5, 6], [7, 8, 9]]
[[3, 2, 3], [4, 5, 6], [7, 8, 9]]
[[3, 2, 3], [4, 5, 6], [7, 8, 9]]
[[3, 2, 3], [6, 5, 6], [7, 8, 9]]
[[3, 2, 3], [6, 5, 6], [7, 8, 9]]
[[3, 2, 3], [6, 5, 6], [7, 8, 9]]
[[3, 2, 3], [6, 5, 6], [9, 8, 9]]