백준 1992 - 쿼드트리 (파이썬)

Answer

N = int(input())
g = [list(map(int, input())) for _ in range(N)]

def solution(x, y, N):
    check = g[x][y]

    for i in range(x, x + N):
        for j in range(y, y + N):
            if check != g[i][j]:
                N = N // 2
                print('(', end = '')
                solution(x, y, N)
                solution(x, y + N, N)
                solution(x + N, y, N)
                solution(x + N, y + N, N)
                print(')', end = '')
                
                return

    if check == 0:
        print(0, end = '')
    else :
        print(1, end = '')

solution(0, 0, N)