Prime Ring Problem（DFS）

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，求1到n是否能构成一个素数环，即一个环内任意相邻的两个数之和为素数；
思路：简单的DFS，先用素数删选法来判别是否为素数，然后DFS递归判断；
代码：

#include<stdio.h>
#include<string.h>
int t;
int b[21],a[100];
int mark[21];
void init()
{
    memset(a,0,sizeof(a));
    for(int i=2;i<=100;i++)
    {
        if(!a[i])
           for(int j=i;j<=100;j+=i)
              a[j]=i;
    }
}
void dfs(int n,int s)
{
    if(s-1==t&&a[n+1]==n+1)
    {
        printf("1");
        for(int i=2;i<=t;i++)
           printf(" %d",b[i]);
        printf("\n");
    }
    if(s-1>=t)
       return;
    for(int j=2;j<=t;j++)
    {
        if(!mark[j]&&a[n+j]==n+j)
        {
            mark[j]=1;
            b[s]=j;
            s++;
            dfs(j,s);
            s--;
            mark[j]=0;
        }
    }
}
int main()
{
    int T=1;
    init();
    while(~scanf("%d",&t))
    {
        printf("Case %d:\n",T++);
        memset(b,0,sizeof(b));
        memset(mark,0,sizeof(mark));
        dfs(1,2);
        printf("\n");
    }
}