[백준✨] 1992번 <쿼드트리> / Python 문제풀이 /
해답) import sys def input(): return sys.stdin.readline() N = int(input()) board = [] for _ in range(N): board.append(list(input())) def isAllSame(s_r, s_c, n): chk = board[s_r][s_c] for i in range(n): for j in range(n): if board[s_r+i][s_c+j] != chk: return False return True def do(s_r, s_c, n): if n == 1: return board[s_r][s_c] if isAllSame(s_r,s_c, n): return board[s_r][s_c] l_u = str(do(s_r, s..
2020. 10. 27.
[백준✨] 1780번 <종이의 개수> / Python 문제풀이
해답) import sys sys.setrecursionlimit(10**8) def input(): return sys.stdin.readline().rstrip() N = int(input()) board = [] result = [0, 0, 0] for _ in range(N): board.append(list(map(int, input().split()))) # 종이가 조건에 맞는지 def isEnd(board, s_r, s_c, length): v = board[s_r][s_c] for i in range(s_r, s_r + length): for j in range(s_c, s_c + length): if board[i][j] != v: return False return True # 분할 d..
2020. 10. 2.
[백준✨] 1992번 <쿼드트리> / Python 문제풀이 /
해답) import sys def input(): return sys.stdin.readline() N = int(input()) board = [] for _ in range(N): board.append(list(input())) def isAllSame(s_r, s_c, n): chk = board[s_r][s_c] for i in range(n): for j in range(n): if board[s_r+i][s_c+j] != chk: return False return True def do(s_r, s_c, n): if n == 1: return board[s_r][s_c] if isAllSame(s_r,s_c, n): return board[s_r][s_c] l_u = str(do(s_r, s..
[백준✨] 1780번 <종이의 개수> / Python 문제풀이
해답) import sys sys.setrecursionlimit(10**8) def input(): return sys.stdin.readline().rstrip() N = int(input()) board = [] result = [0, 0, 0] for _ in range(N): board.append(list(map(int, input().split()))) # 종이가 조건에 맞는지 def isEnd(board, s_r, s_c, length): v = board[s_r][s_c] for i in range(s_r, s_r + length): for j in range(s_c, s_c + length): if board[i][j] != v: return False return True # 분할 d..