[다시 풀어보기] 백준 9663번 "N-Queen"

파이썬

import sys


n = int(sys.stdin.readline())

ans = 0 
row = [0] * n

def is_promising(x):
    for i in range(x):
        if (row[x] == row[i]) or (abs(row[x] - row[i]) == abs(x-i) ):
            return False

    return True

def n_queens(x):
    
    global ans
    
    if x == n :
        ans += 1
        return
    
    else : 
        for i in range(n):
            row[x] = i
            if is_promising(x):
                n_queens(x+1)
                
n_queens(0)
print( ans)
# 참고 : https://seongonion.tistory.com/103

자세한 풀이  🔜 https://seongonion.tistory.com/103

[백준] 9663번 N-Queen - 파이썬(Python)