http://noi.openjudge.cn/english/06/
描述
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.
输入
One positive integer number N (N <= 200).
输出
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小于N，所有列都不相同,每列加上或减去其索引都与其他列不同。
输入：
一个正整数N。
输出：
一个N*N 0/1 矩阵 A={a[i][j]},a[i][j]=1 表示有一个列在细胞（i，j），否则a[i][j]=0.