64,648
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
using namespace std;
int n, total = 0,P[6],hashTable[6] = {false};
void generateP(int index,int n) {
if (index == n + 1) { //递归边界
total++;
for (int k = 1; k <= n; k++)
printf("%d",P[k]);
printf("\n");
return;
}
for (int x = 1; x <= n; x++) {
if (hashTable[x] == false) { //第x行还没有皇后
bool flag = true;
for (int pre = 1; pre < index; pre++) {//遍历之前的皇后
//第index列皇后的行号为x,第pre列皇后的行号为P[pre]
if (abs(index - pre) == abs(x - P[pre])) {
flag = false; //冲突
break;
}
}
if (flag == true) { //可以把皇后放在x列
P[index] = x;
hashTable[x] = true;
generateP(index + 1, n);
hashTable[x] = false;
}
}
}
}
int main()
{
for (int i = 1; i <= 10; i++) {
cout << "Please input a positive number: ";
cin >> n;
generateP(1,n);
printf("Total= %d\n", total);
total = 0;
}
return 0;
}