N Queens（NOIOPJENGLISH06）

N Queens

N Queens | JXNUOJ

 1000ms  65536K

描述：

Determine the columns of N queens should be place on. Columns should be greater than 1 and less than N. Columns should be all different. Each column plus its index should be different from others. Each column minus its index should also be different from others.

确保n个皇后放在每一栏中，每一栏应该多于一个少于n个，每一栏都应该不一样，每一栏加上他的索引应该和别的不同，每一栏减去他的索引也应该和别的不同

输入：

One positive integer number N (N <= 200).

一个正整数表示n

输出：

An N*N 0/1 matrix A = {a[i][j]}, a[i][j]=1 indicates that there is a queue on cell (i,j), and a[i][j]=0 otherwise.

一个n*n的矩阵表示皇后在这一格1或不在这一格0

样例输入：

4

样例输出：

0 1 0 0
0 0 0 1
1 0 0 0
0 0 1 0