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
1 |
6 |
Sample Output
1 |
Case 1: |
思路分析
这题对我来说有些难,最主要是这个递归的过程有点难懂。还是要多看看代码才行,贴出来的代码还是能懂的,但是自己写却比较困难了。
1 |
|
近期评论