huanghou.rar_queen

#include <stdio.h> #include<math.h> #define N 4 static int sum; static int x[N]; int place(int k) { int j; for (j = 0; j < k; j ++) if (x[j] == x[k] || abs(j - k) == abs(x[j] - x[k])) return 0; return 1; } void chessboard() { int i,j; int site[N]; printf("第%d种解法:\n", ++ sum); for (i = 0; i < N; i ++) { for (j = 0; j < N; j ++) if (j == x[i]) {printf("Q ");site[i]=j+1; } else printf("* "); printf("\n"); } printf("A%d(",sum); for(i = 0; i < N; i ++) { printf("%d,",site[i]); } printf(");"); printf("\n"); } void backtrack() { int k = 0; x[0] = -1; while (k >= 0) { x[k] += 1; while ((x[k] < N) && !(place(k))) x[k] += 1; if (x[k] < N) if (k == N - 1) chessboard(); else x[++ k] = -1; else k --; } } int main(void) { backtrack(); printf("%d皇后有%d个解:\n",N,sum); return 0; }