Examine the  checkerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and each column, and there is never more than one in any diagonal. (Diagonals run from southeast to northwest and southwest to northeast and include all diagonals, not just the major two.)

 1   2   3   4   5   6

  -------------------------

1 |   | O |   |   |   |   |

  -------------------------

2 |   |   |   | O |   |   |

  -------------------------

3 |   |   |   |   |   | O |

  -------------------------

4 | O |   |   |   |   |   |

  -------------------------

5 |   |   | O |   |   |   |

  -------------------------

6 |   |   |   |   | O |   |

  -------------------------

The solution shown above is described by the sequence 2 4 6 1 3 5, which gives the column positions of the checkers for each row from  to :

ROW    1    2   3   4   5   6

COLUMN 2    4   6   1   3   5 

This is one solution to the checker challenge. Write a program that finds all unique solution sequences to the Checker Challenge (with ever growing values of ). Print the solutions using the column notation described above. Print the the first three solutions in numerical order, as if the checker positions form the digits of a large number, and then a line with the total number of solutions.

A single line that contains a single integer  () that is the dimension of the  checkerboard.

The first three lines show the first three solutions found, presented as  numbers with a single space between them. The fourth line shows the total number of solutions found.

6

2 4 6 1 3 5

3 6 2 5 1 4

4 1 5 2 6 3

4

题意：N皇后问题，需要输出前三种排放和可以排放的方式的数量

解题思路：只需要记数输出三次，其他的和N皇后一样......（这里用二维数组来判断是否同列同斜线...防超时）

代码如下：

 #include <stdio.h>

 int n,t=,vis[][],c[];

 void dfs(int cur)

 {

     if(cur==n+)

     {

         t++;

         if(t<)

         {

             for(int i=; i<=n-; i++)

                 printf("%d ",c[i]);

             printf("%d\n",c[n]);

         }

     }

     else

     {

         for(int i=; i<=n; i++)

         {

            if(!vis[][i]&&!vis[][cur+i]&&!vis[][cur-i+n])   //判断是否和前面的皇后冲突

            {

                c[cur]=i;

                vis[][i]=vis[][cur+i]=vis[][cur-i+n]=;

                dfs(cur+);

                 vis[][i]=vis[][cur+i]=vis[][cur-i+n]=;

            }

         }

     }

 }

 int main()

 {

     scanf("%d",&n);

     dfs();

     printf("%d\n",t);

     return ;

 }