KEEP GOING

https://swexpertacademy.com/main/learn/course/lectureProblemViewer.do SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com 1. 코드 구현 (bfs 풀이) from collections import deque move = [(1,0),(0,1),(-1,0),(0,-1)] def bfs(x, y): deq = deque([(x,y)]) while deq: x, y = deq.popleft() for dx, dy in move: nx = dx + x ny = dy + y if 0