1. #include "stdio.h"  
    2.  
         
  2. #define num 8  
    3.  
         
  3. int a[num][num],count=0;  
    4.  
         
  4. FILE *fw;        
    5.  
         
  5.  
    6.  
         
  6. int judge()  
    7.  
         
  7. {  
    8.  
         
  8.     int aa=0,bb=0;  
    9.  
         
  9.     int i,j,num1=0;  
    10.  
         
  10.     横排不用判断  
    11.  
         
  11.     for (i=0;i<num;i++)//判断竖排  
    12.  
         
  12.     {  
    13.  
         
  13.         for (j=0;j<num;j++)  
    14.  
         
  14.         {  
    15.  
         
  15.             if (a[j][i]==1)  
    16.  
         
  16.                 num1++;  
    17.  
         
  17.         }  
    18.  
         
  18.         if(num1>1)  
    19.  
         
  19.             return 0;  
    20.  
         
  20.         else 
    21.  
         
  21.             num1=0;  
    22.  
         
  22.     }  
    23.  
         
  23.     num1=0;  
    24.  
         
  24.     for (i=0;i<num;i++)//第一排向下  
    25.  
         
  25.     {  
    26.  
         
  26.         num1=0;  
    27.  
         
  27.         aa=0;  
    28.  
         
  28.         bb=i;  
    29.  
         
  29.         while(bb>=0)//斜向左下  
    30.  
         
  30.         {  
    31.  
         
  31.             if(a[aa][bb]==1)  
    32.  
         
  32.                 num1++;  
    33.  
         
  33.             if(num1>1)  
    34.  
         
  34.                 return 0;  
    35.  
         
  35.             aa++;  
    36.  
         
  36.             bb--;  
    37.  
         
  37.         }  
    38.  
         
  38.         aa=0;  
    39.  
         
  39.         bb=i;  
    40.  
         
  40.         num1=0;  
    41.  
         
  41.         while(bb<num)//斜向右下  
    42.  
         
  42.         {  
    43.  
         
  43.             if(a[aa][bb]==1)  
    44.  
         
  44.                 num1++;  
    45.  
         
  45.             if(num1>1)  
    46.  
         
  46.                 return 0;  
    47.  
         
  47.             aa++;  
    48.  
         
  48.             bb++;  
    49.  
         
  49.         }  
    50.  
         
  50.     }  
    51.  
         
  51.     ///  
    52.  
         
  52.     num1=0;  
    53.  
         
  53.     for(i=0;i<num;i++)//最后一排向上  
    54.  
         
  54.     {  
    55.  
         
  55.         num1=0;  
    56.  
         
  56.         aa=num-1;  
    57.  
         
  57.         bb=i;  
    58.  
         
  58.         while(bb<num)//斜向右上  
    59.  
         
  59.         {  
    60.  
         
  60.             if(a[aa][bb]==1)  
    61.  
         
  61.                 num1++;  
    62.  
         
  62.             if(num1>1)  
    63.  
         
  63.                 return 0;  
    64.  
         
  64.             aa--;  
    65.  
         
  65.             bb++;  
    66.  
         
  66.         }  
    67.  
         
  67.         aa=num-1;  
    68.  
         
  68.         bb=i;  
    69.  
         
  69.         num1=0;  
    70.  
         
  70.         while(bb>=0)//斜向左上  
    71.  
         
  71.         {  
    72.  
         
  72.             if(a[aa][bb]==1)  
    73.  
         
  73.                 num1++;  
    74.  
         
  74.             if(num1>1)  
    75.  
         
  75.                 return 0;  
    76.  
         
  76.             aa--;  
    77.  
         
  77.             bb--;  
    78.  
         
  78.         }  
    79.  
         
  79.     }  
    80.  
         
  80.     return 1;  
    81.  
         
  81.       
    82.  
         
  82. }  
    83.  
         
  83. void init()  
    84.  
         
  84. {  
    85.  
         
  85.     int i,j;  
    86.  
         
  86.     for (i=0;i<num;i++)  
    87.  
         
  87.         for (j=0;j<num;j++)  
    88.  
         
  88.             a[i][j]=0;  
    89.  
         
  89. }  
    90.  
         
  90. void main()  
    91.  
         
  91. {  
    92.  
         
  92.     fw = fopen("b.txt","a");//以追加方式写入   
    93.  
         
  93.     int i,j,c[num];  
    94.  
         
  94.     init();  
    95.  
         
  95.     for (c[0]=0;c[0]<num;c[0]++)  
    96.  
         
  96.         for (c[1]=0;c[1]<num;c[1]++)  
    97.  
         
  97.             for (c[2]=0;c[2]<num;c[2]++)  
    98.  
         
  98.                 for (c[3]=0;c[3]<num;c[3]++)  
    99.  
         
  99.                     for (c[4]=0;c[4]<num;c[4]++)  
    100.  
         
  100.                         for (c[5]=0;c[5]<num;c[5]++)  
    101.  
         
  101.                             for (c[6]=0;c[6]<num;c[6]++)  
    102.  
         
  102.                                 for (c[7]=0;c[7]<num;c[7]++)  
    103.  
         
  103.                                 {  
    104.  
         
  104.                                     a[0][c[0]]=1;  
    105.  
         
  105.                                     a[1][c[1]]=1;  
    106.  
         
  106.                                     a[2][c[2]]=1;  
    107.  
         
  107.                                     a[3][c[3]]=1;  
    108.  
         
  108.                                     a[4][c[4]]=1;  
    109.  
         
  109.                                     a[5][c[5]]=1;  
    110.  
         
  110.                                     a[6][c[6]]=1;  
    111.  
         
  111.                                     a[7][c[7]]=1;  
    112.  
         
  112.                                     if(judge()==1)  
    113.  
         
  113.                                     {  
    114.  
         
  114.                                         count++;  
    115.  
         
  115.                                         fprintf(fw,"第%d种\n",count);  
    116.  
         
  116.                                         printf("第%d种\n",count);  
    117.  
         
  117.                                         for(i=0;i<num;i++)  
    118.  
         
  118.                                         {         
    119.  
         
  119.                                             for (j=0;j<num;j++)  
    120.  
         
  120.                                             {  
    121.  
         
  121.                                                 fprintf(fw,"%d ",a[i][j]);  
    122.  
         
  122.                                                 printf("%d ",a[i][j]);  
    123.  
         
  123.                                             }  
    124.  
         
  124.                                             fprintf(fw,"\n");  
    125.  
         
  125.                                             printf("\n");  
    126.  
         
  126.                                         }  
    127.  
         
  127.                                         fprintf(fw,"\n");  
    128.  
         
  128.                                         printf("\n");  
    129.  
         
  129.                                     }  
    130.  
         
  130.                                     init();  
    131.  
         
  131.                                 }  
    132.  
         
  132.     printf("%d\n",count);  
    133.  
         
  133.     fprintf(fw,"一共%d种\n",count);  
    134.  
         
  134. } 
    135.