15685번 – 드래곤 커브

1

문제 풀이 코드 from copy import deepcopy n = int(input()) curves = [list(map(int, input().split())) for _ in range(n)] board = [[0]*102 for _ in range(102)] dyx = [(0, 1), (-1, 0), (0, -1), (1, 0)] rotate = [1, 2, 3, 0] def findSquares(): count = 0 dyx = [(0, 1), (1, 0), (1, 1)] for y in range(len(board)): for x in range(len(board[y])): if board[y][x] == 1: hasSquare = True for dy, dx in dyx: _y, _x =...