[백준 / Python] 욕심쟁이 판다_1937
정답 코드 n = int(input()) data = [] dp = [[0 for _ in range(n)] for _ in range(n)] for _ in range(n): data.append(list(map(int, input().split()))) dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] def dfs(x, y): if dp[x][y]: return dp[x][y] dp[x][y] = 1 for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0