素数环(递归）问题

 碰到的素数环问题。（信息来自互联网 这里转载一下）

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

  
  

   
   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
  
  

  #include <iostream> using namespace std; const int MAXN = 41; bool visit[MAXN]; int n,p[MAXN],circle[MAXN];//圈X中的数字 void prime(){ int i,j; memset(p,true,sizeof(p)); for(i=2;i<MAXN;i++) for(j=2;i*j<MAXN;j++) p[i*j]=false;//素数 } void dfs(int c,int cnt){ if(cnt==n && p[circle[1]+circle[n]]){ for(int i=1;i<n;i++) printf("%d ",circle[i]); printf("%d/n",circle[n]); } for(int i=c+1;i<MAXN;i++) if(p[i] && i-c<=n && !visit[i-c]){ circle[cnt+1]=i-c; visit[i-c]=true; dfs(i-c,cnt+1); visit[i-c]=false; } } int main(){ int c=1;//第c轮 prime(); while(scanf("%d",&n)!=EOF){ memset(visit,false,sizeof(visit)); printf("Case %d:/n",c++); visit[1]=true,circle[1]=1; dfs(1,1); printf("/n"); } return 0; }

实质是图中的深度优先搜索。