八皇后问题：设8皇后问题的解为 (x1, x2, x3, …,x8), 约束条件为：在8x8的棋盘上，

其中任意两个xi和xj不能位于棋盘的同行、同列及同对角线。要求用一位数组进行存储，输出所有可能的排列。C实现-Eight queens problem: Let the eight queens problem, the solution (x1, x2, x3, ..., x8), constraint conditions: on a 8x8 board, in which any two xi and xj in the board counterparts, the same column with the right moldings. Require an array to store the output of all possible permutations of. Implemented in C