HDOJ--1016--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.
输入描述:
n (0 < n < 20).
输出描述:
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
题意：
n个小伙伴，身上带着1到n的数字，手牵手拉成一个环。当环里的每个人相邻两人身上数字之和都为素数时，便找到了一个环。当找出所有的环时，游戏便结束。
题解：
先打表找出素数，然后直接dfs
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int prime[40] = {
   0,1,1,1,0,1