蓝桥杯基础练习之 2n皇后问题.docVIP

基础练习 2n皇后问题 C++语言 #includecstdio using namespace std; int n; int sum; bool g[9][9]; bool wh[9]; bool wd[17]; bool wu[17]; bool bh[9]; bool bd[17]; bool bu[17]; void white(int h){ if(h==n){ sum++; }else{ for(int i=0;in;i++){ if(!g[h][i])continue; if(wh[i])continue; if(wd[i+h])continue; if(wu[(i-h)+n])continue; wh[i]=wd[i+h]=wu[(i-h)+n]=1; white(h+1); wh[i]=wd[i+h]=wu[(i-h)+n]=0; } } } void black(int h){ if(h==n){ white(0); }else{ for(int i=0;in;i++){ if(!g[h][i])continue; if(bh[i])continue; if(bd[i+h])continue; if(bu[(i-h)+n])continue; g[h][i]=0; bh[i]=bd[i+h]=bu[(i-h)+n]=1; black(h+1); g[h][i]=1; bh[i]=bd[i+h]=bu[(i-h)+n]=0; } } } int main(){ int i; int x; sum=0; scanf(%d,n); for(i=0;in;i++){ wh[i]=bh[i]=0; wd[i]=bd[i]=0; wu[i]=bu[i]=0; for(int j=0;jn;j++){ scanf(%d,x); g[i][j]=(bool)x; } } for(;i2*n;i++){ wd[i]=bd[i]=0; wu[i]=bu[i]=0; } black(0); printf(%d\n,sum); return 0; } C语言 #includestdio.h int a[9][9],n,sum; int row1[9],diagl1[17],diagr1[17],row2[9],diagl2[17],diagr2[17]; void dfs2(int i) { int j; if(i==n+1) { sum++; return; } for(j=1;j=n;j++) { if(a[i][j]==1row2[j]!=0diagl2[n-i+j]!=0diagr2[i+j]!=0) { a[i][j]=0; row2[j]=0; diagl2[n-i+j]=0; diagr2[i+j]=0; dfs2(i+1); row2[j]=1; diagl2[n-i+j]=1; diagr2[i+j]=1; a[i][j]=1; } } } void dfs1(int i) { int j,h,r; if(i==n+1) { for(h=1,r=1;r=n;r++) { if(a[1][r]==1) { a[1][r]=0; row2[r]=0; diagl2[n-h+r]=0; diagr2[h+r]=0; dfs2(h+1); row2[r]=1; diagl2[n-h+r]=1; diagr2[h+r]=1; a[1][r]=1; } } } for(j=1;j=n;j++) { if(a[i][j]==1row1[j]!=0diagl1[n-i+j]!=0diagr1[i+j]!=0) { a[i][j]=0; row1[j]=0; diagl1[n-i+j]=0; diagr1[i+j]=0; dfs1(i+1); row1[j]=1; diagl1[n-i+j]=1; diagr1[i+j]=1; a[i][j]=1; } } } int main() { int i,j; while(scanf(%d,n)!=E