原文:
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皇后问题
1000ms 65536K
描述:
决定这N个国际象棋皇后要摆放的列标。每个皇后所摆放的列标必须大于1且小于N,并且列标不能相同,需要注意的是每个皇后的列标加上行标应该互不相等,每个皇后的列标减去行标应该互不相等。
注:简而言之,就是要在N*N的矩阵上放置N个皇后,它们互不相吃。
输入:
一个正整数N(N <= 200)
输出:
一个N*N的 0/1 矩阵A = {a[i][j]},(0 <= i,j < N)如果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