作业：17N皇后问题

提示：该blog仅为完成作业，大佬请绕路

---

老师的代码

#include <stdio.h>
#include <malloc.h>
#include <math.h>

/**
 * Place it there, applicable?
 */
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;
    }//Of for
    return true;
}//Of place

/**
 * Backtracking.
 */
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);
        }//Of for i
    }//Of if
}//Of backtracking

/**
 * Title: n queens.<br>
 */
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);
}//Of nQueen

/**
 * The entrance.
 */
int main(){
	nQueen(5);
	return 1;
}//Of main

我的代码

#include<stdio.h>
#include<math.h>
int rank[20];
bool vis[20];
int n,cnt=0;
void dfs(int pos){
	if(pos==n+1){//递归边界条件 
		cnt++;
		return;
	}
	for(int i=1;i<=n;i++){//枚举每行 
		if(vis[i]==false){
			bool flag=true;
			for(int j=1;j<pos;j++){//枚举pos之前的皇后 
				if(abs(pos-j)==abs(i-rank[j])){
					flag=false;
					break;
				}
			}
			if(flag){
				rank[pos]=i;//pos列在i行 
				vis[i]=true;
				dfs(pos+1); 
				vis[i]=false;
			}
		}
	}
}
int main(){
	scanf("%d",&n);
	dfs(1);
	printf("%d",cnt);
	return 0;
}