315
深搜回溯-素數環-1459-jobdu
題目1459：Prime ring problem
時間限製：2 秒內存限製：128 兆特殊判題：否提交：747解決：306
題目描述：
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.
輸入：
n (1 < n < 17).
輸出：
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.
樣例輸入：
6
8
樣例輸出：
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
提示：
用printf打印輸出。
最後更新：2017-04-03 12:55:52