N后问题

暂不编辑，先放源码

/** * N后问题 */ //#define LOCAL #include <stdio.h> #include <string.h> #define MAXN 50 + 10 int qeen[MAXN][MAXN]; int rLine[2 * MAXN]; int lLine[2 * MAXN]; int col[MAXN]; int n; int count; void mytry(int x); void printGraph(); int main() { #ifdef LOCAL freopen("C:\\Users\\Administrator\\Desktop\\Temp\\ACMTempIn.txt", "r", stdin); //freopen("C:\\Users\\Administrator\\Desktop\\Temp\\ACMTempOut.txt", "w", stdout); #endif while(scanf("%d" , &n) != EOF && n <= 50) { // 输出提示 printf("%-2d皇后问题\n\n", n); // 初始化 count = 0; memset(col, 0, sizeof(col)); memset(rLine, 0, sizeof(rLine)); memset(lLine, 0, sizeof(lLine)); memset(col, 0, sizeof(col)); // 算法主体 mytry(0); // 输出结果 printf("Count = %d\n", count); } return 0; } void mytry(int x) { int i; for(i = 0; i < n; i++) { if(!qeen[x][i]&&!rLine[x + i]&&!lLine[x - i + n]&&!col[i]) { rLine[x + i] = true; lLine[x - i + n] = true; col[i] = true; qeen[x][i] = 1; if(x == n - 1) { count++; printGraph(); } else mytry(x + 1); rLine[x + i] = false; lLine[x - i + n] = false; col[i] = false; qeen[x][i] = 0; } } return ; } void printGraph() { int i, j; printf("Case %-2d :\n", count); for(i = 0; i < n; i++) { printf("%-2d :", i + 1); for(j = 0; j < n; j++) { printf(" %d", qeen[i][j]); } printf("\n"); } printf("\n"); }