【HDU 1016】Prime Ring Problem(DFS、素数筛)

Prime Ring Problem

---

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

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

---

题意

已知一个数n，将数字1~n围成一个圆环，要求： 相邻两个数之和为素数。
输出：

• 数字的方向一致（同顺时针或同逆时针），并保证排列不重复
• 只有一个数（n==1）时，输出1
• 输出Case k:（k为数据组数），每一组输出（第一个除外）之前都有一个空行

---

思路：

• 
  
• 要求每两个相邻数之和都为素数，那么只要每次递归调用DFS时判断之前两个数之和是否为素数ÿ