| ||||||||||
Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Solution to the n Queens Puzzle
Description The
eight queens puzzle is the problem of putting eight chess queens on an
8 ¡Á 8 chessboard such that none of them is able to capture any other.
The puzzle has been generalized to arbitrary n ¡Á n boards. Given n, you are to find a solution to the n queens puzzle. Input The input contains multiple test cases. Each test case consists of a single integer n between 8 and 300 (inclusive). A zero indicates the end of input. Output For each test case, output your solution on one line. The solution is a permutation of {1, 2, ¡, n}. The number in the ith place means the ith-column queen in placed in the row with that number. Sample Input Sample Output Source |
[Submit] [Go Back] [Status] [Discuss]
All Rights Reserved 2003-2006 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator