🐣 문제

링크 : https://www.acmicpc.net/problem/9663sons/12916)

🐥 코드

#include <iostream>
#define MAX 15
using namespace std;

int col[MAX];
int N, total = 0;

bool check(int level){
    for(int i = 0; i < level; i++)
        if(col[i] == col[level] || abs(col[level] - col[i]) == level - i) return false;
    return true;
}

void nqueen(int x){
    if(x == N)
        total++;

    for(int i = 0; i < N; i++){
        col[x] = i; 
        if(check(x)) nqueen(x+1);
    }
}

int main() {
    cin >> N;
    nqueen(0);
    cout << total;
}