[구현 문제] 백준 14503번: 로봇 청소기
https://www.acmicpc.net/problem/14503 x_lim, y_lim = map(int, input().split()) # north 0, east 1, south2, west3 dx = [-1, 0, 1, 0] dy = [0, 1, 0, -1] x, y, d = map(int, input().split()) table = [] for i in range(x_lim): table.append(list(map(int,input().split()))) count = 0 while True: # cleaning => 2 if table[x][y]==0: table[x][y]= 2 count+=1 stuck = True for i in range(4): # left direction lx ..
2021. 5. 28.
