https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH06
N Queens
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 大小的矩阵A = {a[i][j]},a[i][j]=1表明这个空位有一个皇后,而a[i][j]=0则表示没有。)