1.N后问题实现
代码如下(示例):
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
#include <malloc.h>
bool place(int *paraSolution, int paraT) {
int j;
for (j = 1; j < paraT; j++) {
if ((abs(paraT - j) == abs(paraSolution[j] - paraSolution[paraT])) || (paraSolution[j] == paraSolution[paraT]))
return false;
}
return true;
}
void backtracking(int *paraSolution, int paraN, int paraT) {
int i;
if (paraT > paraN) {
for (i = 1; i <= paraN; i++)
printf("%d ", paraSolution[i]);
printf("\r\n");
}
else {
for (i = 1; i <= paraN; i++) {
paraSolution[paraT] = i;
if (place(paraSolution, paraT))
backtracking(paraSolution, paraN, paraT + 1);
}
}
}
void nQueen(int paraN) {
int i;
int* solution = (int*)malloc((paraN + 1) * sizeof(int));
for (i = 0; i <= paraN; i++)
solution[i] = 0;
backtracking(solution, paraN, 1);
}
int main() {
nQueen(5);
return 1;
}
2.读入数据
代码如下(示例):
1 3 5 2 4
1 4 2 5 3
2 4 1 3 5
2 5 3 1 4
3 1 4 2 5
3 5 2 4 1
4 1 3 5 2
4 2 5 3 1
5 2 4 1 3
5 3 1 4 2