0024 c++每日一题（深度优先）

今日题目
【题目描述】
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.
【输入】
n (0 < n ≤ 16)
【输出】
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.
【样例输入】
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
Mine程序
深度优先

#include

复制代码

#include

复制代码

#include

复制代码

using namespace std;

复制代码

int n,vis[20]={0},num[20];

复制代码

bool is_prime(int a)

复制代码

{

复制代码

if(a==2)

复制代码

return true;

复制代码

[code] for(int i=2;i