n, m = 3,4
10 7 4 1
11 8 5 2
12 9 6 3
n, m = 4,5
17 13 9 5 1
18 14 10 6 2
19 15 11 7 3
20 16 12 8 4
r,c = map(int,input().split())
GRAPH = [[0]*c for _ in range(r)]
count = 0
for i in reversed(range(c)): # bigger loop going left
for j in range(r): # smaller loop going down
count += 1
GRAPH[j][i] = count # [j] to fill columm, [i] to fill row
for i in GRAPH:
print(*i)
'ALGORITHMS > 구현' 카테고리의 다른 글
백준 1931 - 달팽이 배열 (0) | 2021.12.15 |
---|