(c++) SWEA "2806) N-Queen"

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=1&problemLevel=2&problemLevel=3&contestProbId=AV7GKs06AU0DFAXB&categoryId=AV7GKs06AU0DFAXB&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=CCPP&select-1=3&pageSize=10&pageIndex=1 

SW Expert Academy

---

#include <iostream>
#include <vector>

using namespace std;

int N, sum = 0;

bool check(int limit, vector<int> &rows) {
	for (int i = 0; i < limit; i++) {
		if (rows[i] == rows[limit] || abs(rows[i] - rows[limit]) == limit - i) {
			return false;
		}
	}
	return true;
}

void Nqueen(int row, vector<int> &rows) {
	if (row == N) {
		sum++;
		return;
	}
	for (int i = 0; i < N; i++) {
		rows[row] = i;
		if (check(row,rows)) {
			Nqueen(row + 1,rows);
		}
	}
}

int main() {
	int T; cin >> T;
	for (int t = 1; t <= T; t++) {
		vector<int> rows(20, -1);
		sum = 0;
		cin >> N;
		Nqueen(0,rows);
		cout << "#" << t << " " << sum << endl;
	}
	return 0;
}

 

참고한 블로그 : 
https://cryptosalamander.tistory.com/58

[백준 / BOJ] - 9663번 N-Queen C++ 풀이