백준 소스코드 [C++] 9663 N-Queen

www.acmicpc.net/problem/9663

9663번: N-Queen

백준 소스코드 [C++] 9663 N-Queen

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
typedef long long ll;
using namespace std;
#define all(v) v.begin(),v.end()
int n;
bool chk_x[15],chk_y[15],chk_dia1[31], chk_dia2[31];

int res = 0;
void dfs(int i) {
	if (i == n) {
		res++; return;
	}
	for(int j=0;j<n;j++)
		if (chk_x[j]==false && chk_y[i]==false && chk_dia1[i+j]==false &&chk_dia2[i-j+15] == false) {
			chk_x[j] = true, chk_y[i] = true, chk_dia1[i + j] =true, chk_dia2[i - j+15] = true;
			dfs(i + 1);
			chk_x[j] = false, chk_y[i] = false,chk_dia1[i + j] = false, chk_dia2[i - j + 15] = false;
		}
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	dfs(0);
	cout << res;
	return 0;
}