Description: N queens problem
Subject description:
In the N* N of checkerboard placed N queens so that they do not attack each other (that is, any two Queens are not allowed in the same row, the same column, are not allowed on the board at a 45 angle diagonal border .
Your task is, for a given N, determine how many legitimate way of placing.
enter:
There are a number of test cases, each test case corresponds to a row of a positive integer N≤10, represents the board number and queens if N = 0, indicates the end of input.
Output:
For each test case output a line a positive integer representing the total number of viable placement program corresponding to the board of the Queen.
To Search:
File list (Check if you may need any files):
nhuanghouwenti.txt
Download