题目地址:https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH06
N Queens
N皇后问题
描述:
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个皇后的列的位置。列数应该比1大且比n小,每一列应该都全部不一样。每个列加上它的索引应该与其他列不同。每一列减去它的索引也应该与其他列不同。
输入:
One positive integer number N (N <= 200).
一个正整数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的矩阵A = {a[i][j]},a[i][j]代表皇后在(i,j)里,然后a[i][j]=0 反之。
样例输入:
4
样例输出:
0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0