[ BOJ / 파이썬 ] 7562 나이트의 이동
/ 제출 1 / # 22.08.17 24분간 풀어본 망한 풀이(무한 재귀) import sys input = sys.stdin.readline from collections import deque # 8가지 dx = [-2, -1, 1, 2, -1, -1, 1, 2] dy = [1, 2, 2, 1, -1, -2, -2, -1] tc = int(input()) for i in range(tc): l = int(input()) board = [[0] * l for _ in range(l)] currentX, currentY = map(int, input().split()) targetX, targetY = map(int, input().split()) q = deque([(currentX, currentY)..
