장애물인식프로그램

문제 링크 https://softeer.ai/practice/6282 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 문제 풀이 def dfs(x, y): if x = n or y = n: return False if graph[x][y] == 1 and not visited[x][y]: global count visited[x][y] = 1 count += 1 for i in range(4): nx = x + dx[i] ny = y + dy[i] dfs(nx, ny) return True return False n = int(input()) graph = [list(map(int, input())) for _ in range(n)] visited..