풀캠정글러

def f(n, r, c) : if [n, r, c] == [0, 0, 0] : return 0 x = pow(2, n-1) if r = x : return f(n, r, c-x) + pow(x, 2) elif r>= x and c = x and c>= x : return f(n, r-x, c-x) + 3 * pow(x, 2) n, r, c = map(int, input().split()) print(int(f(n, r ,c))) 2차원 배열을 가로반 세로반 4등분 했을때, 좌상단 덩어리는 N=n-1의 배열과 같다. f(n..

n = int(input()) stack = 0 Qlist = [] def Qcheck(Qlist, Q) : for i in range(len(Qlist)) : if Q == Qlist[i] or abs(len(Qlist) - i) == abs(Q - Qlist[i]) : return False return True def DFS(Qlist, Q) : global stack if len(Qlist) == n - 1 : if Qcheck(Qlist, Q) : stack = stack + 1 if Qcheck(Qlist, Q) : for i in range(n) : DFS(Qlist + [Q], i) if n = 12 and ..

a = [] def hanoi1to2(n) : if n == 1 : a.append('1 2') else : hanoi1to3(n-1) a.append('1 2') hanoi3to2(n-1) def hanoi1to3(n) : if n == 1 : a.append('1 3') else : hanoi1to2(n-1) a.append('1 3') hanoi2to3(n-1) def hanoi2to1(n) : if n == 1 : a.append('2 1') else : hanoi2to3(n-1) a.append('2 1') hanoi3to1(n-1) def hanoi2to3(n) : if n == 1 : a.append('2 3') else : hanoi2to1(n-1) a.append('2 3') hanoi1..

def prime(n) : if n < 2 : return False for j in range(2, n//2+1) : if n%j == 0 : return False return True primelist = [] for i in range(10000) : if prime(i) : primelist.append(i) testcase = int(input()) for j in range(testcase) : n = int(input()) for i in range(n//2+1) : a = n//2 - i b = n//2 + i if a in primelist and b in primelist : print(a, b, sep = ' ') break 1. 소수면 T, 소수가 아니면 F를 출력하는 함수 pri..