개발/문제풀이
[BOJ 27211, Python] 도넛 행성 풀이
import sys from collections import deque input = sys.stdin.readline dx = [0,0,1,-1] dy = [1,-1,0,0] matrix = [] n,m = map(int,input().split()) for _ in range(n): matrix.append(list(map(int,input().split()))) count = 0 def bfs(sx,sy): queue = deque() queue.append((sx,sy)) matrix[sy][sx] = 1 while queue: nx,ny = queue.popleft() for i in range(4): tx,ty = nx+dx[i], ny+dy[i] if(tx == -1): tx = m - 1..
