n_queen.rar_queen_棋子queen

#include"iostream.h" #include"math.h" bool Place(int k,int i,int *x) //k为行数，i为列数,x[]储存皇后位置 {//判断两个皇后是否在同一列或同一斜线上 for(int j=0;j<k;j++) if((x[j]==i)||(abs(x[j]-i)==abs(j-k))) return false; return true; } void NQueens(int k,int n,int *x,int &count) { for(int i=0;i<n;i++) { if(Place(k,i,x)) { x[k]=i; if(k==n-1) { count++; cout<<"Solution"<<count<<":"<<endl; for(i=0;i<n;i++) { cout<<x[i]<<" "; for(int j=0;j<x[i];j++) cout<<"- "; cout<<"* "; for(j=x[i]+1;j<n;j++) cout<<"- "; cout<<endl; } cout<<endl; } else NQueens(k+1,n,x,count); } } } void NQueens(int n,int *x,int &count) { NQueens(0,n,x,count); } int main() { int n; cout<<"Please Input the number of queens:n="<<endl; cin>>n; cout<<endl; int *array=new int[n]; int count=0; NQueens(n,array,count); delete[] array; return 0; }