Prime Ring Problem

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

题意:经典题目素数环。相邻两个数字之间互质，输入数字n，输出所有符合要求序列（无重复）。

#include<iostream>
using namespace std;
int m;
int a[20]={0};
int visit[20]={0};
int prime(int n){///素数
    int i;
    for(i=2;i<n/2+1;i++){
        if(n%i==0){
            break;
        }
    }
    if(i>=n/2+1&&n>1)return 1;
    else return 0;
}
void dfs(int cnt){///深搜
    int i;
    if(prime(a[0]+a[m-1])==1&&cnt==m){
        cout<<a[0];
        for(i=1;i<m;i++)
            cout<<' '<<a[i];
        cout<<endl;
    }else for(i=2;i<=m;i++){
        if(!visit[i]&&prime(i+a[cnt-1])){
            a[cnt]=i;
            visit[i]=1;
            dfs(cnt+1);
            visit[i]=0;
        }
    }
    
}



int main(){
    int i;
    int count=0;
    while(cin>>m){
        for(i=0;i<m;i++){
            a[i]=i+1;
        }
        count++;
        cout<<"Case "<<count<<":"<<endl;
        dfs(1);
        cout<<endl;
        
        
    }
    
    
    
    return 0;
}