POJ 3239 Solution to the n Queens Puzzle

最新推荐文章于 2018-06-23 10:05:23 发布

Nightonke

最新推荐文章于 2018-06-23 10:05:23 发布

阅读量935

点赞数

分类专栏： poj 文章标签： poj

本文链接：https://blog.csdn.net/u012925008/article/details/44513379

版权

Solution to the n Queens Puzzle

Time Limit: 1000MS		Memory Limit: 131072K
Total Submissions: 3469		Accepted: 1275		Special Judge

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.

POJ 3239 Solution to the n Queens Puzzle - Night - Time Ends.

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.

最低0.47元/天解锁文章

Nightonke

关注

0
点赞
踩
2

收藏

觉得还不错? 一键收藏
0
评论
POJ 3239 Solution to the n Queens Puzzle

Solution to the n Queens PuzzleTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3469 Accepted: 1275 Special JudgeDescriptionThe eight queens p
复制链接

扫一扫

专栏目录