八皇后

 1 void search(int cur)
 2 {
 3     if(cur==n)
 4         tot++;
 5     else{
 6         for(int i=0; i<n; i++){
 7             if(!vis[0][i]&&!vis[1][cur+i]&&!vis[2][cur-i+n]){
 8                 C[cur]=i;
 9                 vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=1;
10                 search(cur+1);
11                 vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=0;
12             }
13         }
14     }
15 }

 

转载于:https://www.cnblogs.com/wangmengmeng/p/5436472.html