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. 

 

Inputn (0 < n < 20). 
OutputThe 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>
#include <math.h>
using namespace std;
int arr[22];
int book[22];
int n,i=1;
bool isPrime(int x){
    if(x<2)
        return false;
    for(int i=2;i<=sqrt(x);i++){
        if(x%i==0)
            return false;
    }
    return true;
}

void dfs(int step){
    if(step==n&&isPrime(arr[1]+arr[n])){
        for(int i=1;i<n;i++)
            cout<<arr[i]<<" ";
        cout<<arr[n]<<endl;
        return;
    }
    else{
        for(int i=2;i<=n;i++){
            if(book[i]!=1&&isPrime(i+arr[step])){
                arr[step+1]=i;
                book[i]=1;
                dfs(step+1);
                book[i]=0;
            }
        }
    }
    return;
}
int main(){
    while(cin>>n){
        memset(book, 0, sizeof(book));
        arr[1]=1;
        
        cout<<"Case"<<" "<<i++<<":"<<endl;
        dfs(1);
        cout<<endl;
    }
    return 0;
}