显示代码纯文本
#include<cstdio>
using namespace std;
bool notP[50]={1,1,0,0,1,0,1,0,1,1,1,0,1,0,1,1,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1};
int seq[15];
bool used[16];
int len;
int sol = 0;
void output(){
for(int i = 0;i<len-1;++i)
printf("%d ",seq[i]);
printf("%d\n",seq[len-1]);
}
void dfs(int pos){//enumerate num at seq[pos]
if(pos == len){
++sol;
output();
return;
}else{
for(int i = 1;i<=len;++i){
if((pos == 0||!used[i]&&!notP[seq[pos-1]+i])){
used[i] = true;
seq[pos] = i;
dfs(pos+1);
used[i] = false;
}
}
}
}
int main(){
freopen("dfs3.in","r",stdin);
freopen("dfs3.out","w",stdout);
scanf("%d",&len);
dfs(0);
printf("%d",sol);
fclose(stdin);fclose(stdout);
return 0;
}