judgex[i]=1;
judge1[j+i]=1;
judge2[j-i+n]=1;
dfs(j+1);
judgex[i]=0;
judge1[j+i]=0;
judge2[j-i+n]=0;
注意不要直接搜,先到搜索表。
/*#include<stdio.h>
int ans[11]={0,1,0,0,2,10,4,40,92,352,724};
int main(){
int n;
while(~(scanf("%d",&n)),n)
printf("%d\n",ans[n]);
return 0;
}
*/
#include<stdio.h>
#include<string.h>
#define CL(a) memset(a,0,sizeof(a))
int judgex[11];//列
int judge1[25];//斜1
int judge2[25];//斜2
int ans=0,n;
int a[11];
void dfs(int j){
if(n+1==j){
ans++; //printf("%d \n",ans);
return;
}
int i;
for(i=1;i<=n;i++){
if(judgex[i]==0&&judge1[j+i]==0&&judge2[j-i+n]==0){
// printf("x=%d j=%d\n",j,i);
judgex[i]=1;
judge1[j+i]=1;
judge2[j-i+n]=1;
dfs(j+1);
judgex[i]=0;
judge1[j+i]=0;
judge2[j-i+n]=0;
}
}
}
int main(){
int i;
for(n=1;n<=10;n++){
ans=0;
CL(judgex);
CL(judge1);
CL(judge2);
for(i=1;i<=n;i++){
judgex[i]=1;
judge1[1+i]=1;
judge2[1-i+n]=1;
dfs(2);
judgex[i]=0;
judge1[1+i]=0;
judge2[1-i+n]=0;
}
a[n]=ans;
}
while(~scanf("%d",&n),n){
printf("%d\n",a[n]);
}
return 0;
}