题目:
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.
输入:
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.
样例输入:
4
样例输出:
0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0
翻译:
描述:
求N个皇后应该被放置的列。列应该大于1小于N,列数应该是不同的,每一列加它的索引不同于其他的列,每一列减去它的索引和其他列也不同。
输入:
一个正整数N(N<=200)。
输出:
一个N*N 0/1的矩阵A={a[i][j]},a[i][j]=1表示在(i,j)的位置存在一个队列,否则a[i][j]=0。
样例输入:
4
样例输出:
0 1 0 0
0 0 0 1
1 0 0 0
0 0 1 0