c++:八皇后问题

好久没更新了..最近在看Linux 各种排序和算法 = =, 快要准备期末考试了,整理整理暑假再更

有哪里不懂可以评论交流

#include
#include
#include

using namespace std;

vector C;
int n;
int tot = 0;

void dfs(int cur);
void printChess(int num);

int main(void) {
	cout << "press count of queens: ";
	cin >> n;
	dfs(0);
	cout << "	" << tot << " solutions in all." << endl;
	return 0;
}

void dfs(int cur) {
	if(cur==n) printChess(++tot);
	else for(int i=0;i