C - 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.

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<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int a[21];
int prime[38]=
{0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1};
int book[21];
void dfs(int ans,int n)
{
    int i;
    if(ans==n&&(prime[1+a[n-1]]))
    {
        cout<<"1";
        for(i=1;i<n;i++)
        cout<<" "<<a[i];
        printf("\n");
        return ;
    }
    {
        for(i=2;i<=n;i++)
        {
            if(book[i]==0&&prime[i+a[ans-1]])
            {
                book[i]=1;
                a[ans]=i;
                dfs(ans+1,n);
                book[i]=0;
            }
        }
        return;
    }
}
int main ()
{
    int i,n,j=1;
    a[0]=1;
    while(~scanf("%d",&n))
    {
        memset(book,0,sizeof(book));
        book[0]=1;
        book[1]=1;
        cout<<"Case "<<j<<":\n";
        dfs(1,n);   
        j++;
        cout<<endl;
    }
    return 0;
 }