#include<stdio.h>
#include<stdlib.h>
#define N 8
int sum=0;
initqipan(int qipan[][N])
{int i,j;
for(i=0;i<N;i++)
for(j=0;j<N;j++)
qipan[i][j]=0;
return 0;
}
print(int qipan[][N])
{int i,j;
for(i=0;i<N;i++)
{for(j=0;j<N;j++)
printf("%d",qipan[i][j]);
printf("\n");
}
printf("\n");
return 0;
}
int panduan(int qipan[][N],int i,int j)
{int n;
for(n=1;j+n<N;n++) /*you*/
{if(qipan[i][j+n]==0)
continue;
else
return 0;
}
for(n=1;j-n>=0;n++) /*zuo*/
{if(qipan[i][j-n]==0)
continue;
else
return 0;
}
for(n=1;i+n<N;n++) /*xia*/
{if(qipan[i+n][j]==0)
continue;
else
return 0;
}
for(n=1;i-n>=0;n++) /*shang*/
{if(qipan[i-n][j]==0)
continue;
else
return 0;
}
for(n=1;i+n<N&&j+n<N;n++) /*youxia*/
{if(qipan[i+n][j+n]==0)
continue;
else
return 0;
}
for(n=1;i-n>=0&&j+n<N;n++) /*youshang*/
{if(qipan[i-n][j+n]==0)
continue;
else
return 0;
}
for(n=1;i+n<N&&j-n>=0;n++) /*zuoxia*/
{if(qipan[i+n][j-n]==0)
continue;
else
return 0;
}
for(n=1;i-n>=0&&j-n>=0;n++) /*zuoshang*/
{if(qipan[i-n][j-n]==0)
continue;
else
return 0;
}
return 1;
}
trial(int qipan[][N],int i,int n)
{int k;
if(i>=n)
{print(qipan);
sum=sum+1;
}
else for(k=0;k<n;k++)
{qipan[i][k]=1;
if(panduan(qipan,i,k))
trial(qipan,i+1,n);
qipan[i][k]=0;
}
return 0;
}
main()
{
int qipan[N][N];
initqipan(qipan);
void clrscr();
trial(qipan,0,N);
printf("sum=%d\n",sum);
return 0;
}