Prime Ring Problem

zjsru_Beginner

于 2022-07-23 16:24:15 发布

阅读量148

点赞数

分类专栏： C++ 递归文章标签： c++ 开发语言

本文链接：https://blog.csdn.net/zjsru_beginner/article/details/125948802

版权

**题目描述**:
A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 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<=16)

>**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.
You are to write a program that completes above process.

>**Sample Input**
6
8

>**Sample Output**

Case 1:
1 4 3 2 5 6
1 6 5 2 3 4

Case 2:
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2

**题目解释*