当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3239:Solution to the n Queens Puzzle

Special Judge 特殊评判
题目描述

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.

输入解释

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.

输出解释

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.

输入样例
8
0
输出样例
5 3 1 6 8 2 4 7

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3239

最后修改于 2020-10-29T06:56:34+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 131072