본문 바로가기

ALGORITHMS/구현

 (2)
코드업 1467 - 2차원 배열 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)
백준 1931 - 달팽이 배열 n = 5 25 10 11 12 13 24 9 2 3 14 23 8 1 4 15 22 7 6 5 16 21 20 19 18 17 n = 7 import numpy as np n = 7 GRAPH = [[0]*n for _ in range(n)] r,c = 0,0 dist = 0 dr = [1,0,-1,0] # 하,우,상,좌 dc = [0,1,0,-1] for i in range(n*n,0,-1): GRAPH[r][c] = i r+=dr[dist] c+=dc[dist] # BOUNDARY CHECKING --> if GRAPH[r][c] != 0, done with outer boundary (ie. "26", "10", "2" if r = n or c = n or GR..

티스토리툴바