HDU 1016 Prime Ring Problem（素数环问题）

最新推荐文章于 2019-07-09 01:02:49 发布

原创

最新推荐文章于 2019-07-09 01:02:49 发布 · 403 阅读

1 ·

CC 4.0 BY-SA版权

这是一个关于ACM竞赛的题目，题目编号为1016，名为'Prime Ring Problem'，主要考察算法和素数理论。参赛者需在限定的时间和内存限制内提交解决方案，已知总提交数和成功通过数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

传送门：

http://acm.hdu.edu.cn/showproblem.php?pid=1016

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 63806 Accepted Submission(s): 27457

Problem Description

A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.

Note: the number of first circle should always be 1.

Input

n (0 < n < 20).

Output

The output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order.

You are to write a program that completes above process.

Print a blank line after each case.

Sample Input

6 8