Development Artist

문제 유형 코딩 난이도 hard Note 1. bfs문제 유형. '순회'라는 개념. dxy : 비숍이 갈 수 있는 좌표를 설정. Code # -*- coding: utf-8 -*- # UTF-8 encoding when using korean # 3차 3번 def solution(bishops): answer = 0 dxy = [[1,1],[1,-1],[-1,1],[-1,-1]] field = [[0] * 8 for i in range(8)] for bis in bishops: x = ord(bis[0])-65 y = int(bis[1])-1 field[x][y] = 1 for dx, dy in dxy: nx , ny = x, y while True: nx += dx ny += dy if nx >=8 o..