C实现8皇后问题拓展至n皇后问题

方法一：枚举法C语言实现8皇后问题
#include<stdio.h>
#include<math.h>
int main()
{int a[9];
 int i;
 int check(int a[],int n);
 for(a[1]=1;a[1]<=8;a[1]=a[1]+1)
 for(a[2]=1;a[2]<=8;a[2]=a[2]+1)
 {if(check(a,2)==0)continue;
   for(a[3]=1;a[3]<=8;a[3]=a[3]+1)
   {if(check(a,3)==0)continue;
     for(a[4]=1;a[4]<=8;a[4]=a[4]+1)
  {if(check(a,4)==0)continue;
    for(a[5]=1;a[5]<=8;a[5]=a[5]+1)
{if(check(a,5)==0)continue;
   for(a[6]=1;a[6]<=8;a[6]=a[6]+1)
 {if(check(a,6)==0)continue;
       for(a[7]=1;a[7]<=8;a[7]=a[7]+1)
   {if(check(a,7)==0)continue;
    for(a[8]=1;a[8]<=8;a[8]=a[8]+1)
   {if(check(a,8)==0)continue;
else
for(i=1;i<=8;i=i+1)
printf("%d\n",a[i]);
return 0;
}} } }}}}}