[백준 문제풀이] 얼렁뚱땅 14712 넴모넴모(Easy) 풀이

https://www.acmicpc.net/problem/14712

14712번: 넴모넴모 (Easy)

 

n, m = map(int,input().split())
arr = [[0]*m for _ in range(n)]

count = 0

def dfs(num) :

    global count

    if num == n*m :
        count += 1
        return

    x , y = num//m, num%m

    if (0<x<n and 0<y<m) and arr[x-1][y] and arr[x][y-1] and arr[x-1][y-1] :
        dfs(num+1)
    else :
        arr[x][y] = 1
        dfs(num + 1)
        arr[x][y] = 0
        dfs(num + 1)
dfs(0)
print(count)