재귀, 분할정복 문제 https://www.acmicpc.net/problem/1074 풀이코드  (실패1, 메모리초과)import sys N, r, c = map(int, sys.stdin.readline().split())arr = [[-1] * 2 ** N for _ in range(2 ** N)]def visit(n, i, j): global cnt, r, c if n == 1: arr[i][j] = cnt cnt += 1 else: if arr[r][c] != -1 : return newSize = n // 2 visit(newSize, i, j) visit(newSize, i, j + newSize) ..