代码

#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;//注意，N皇后 int a[15];
bool b[15],c[30],d[30];
int sum,k=3,N;void print(){if(k>0){for(int i=1;i<=N;i++){cout<<a[i]<<' ';}cout<<endl;--k;}sum++;
}void tryy(int t){int j;for(j=1;j<=N;j++){if(b[j]&&c[t+j-1]&&d[t-j+N]){a[t]=j;b[j]=false;c[t+j-1]=false;d[t-j+N]=false;if(t==N) print();else tryy(t+1);b[j]=true;c[t+j-1]=true;d[t-j+N]=true;}}
} int main(){memset(b,1,sizeof(b));memset(c,1,sizeof(c));memset(d,1,sizeof(d));
//    freopen("01.txt","r",stdin);scanf("%d",&N); tryy(1);printf("%d\n",sum);return 0;
}

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6 int a[30],b[30],c[30],jilu[30],N,cnt;
 7 void print(){
 8     if(cnt<3){
 9         for(int i=1;i<=N;i++){
10             printf("%d ",jilu[i]);
11         }
12         puts("");
13     }
14     ++cnt;
15 }
16
17 void search(int j){
18     for(int i=1;i<=N;i++){
19         if(a[i]==0&&b[i+j-1]==0&&c[i-j+14]==0){
20             jilu[j]=i;
21             a[i]=1;
22             b[i+j-1]=1;
23             c[i-j+14]=1;
24
25             if(j==N) print();
26             else search(j+1);
27
28             a[i]=0;
29             b[i+j-1]=0;
30             c[i-j+14]=0;
31         }
32
33     }
34 }
35 int main(){
36 //    freopen("01.txt","r",stdin);
37     scanf("%d",&N);
38     search(1);
39     printf("%d\n",cnt);
40     return 0;
41 }

假装不存在