【HDU 1016】 Prime Ring Problem (dfs)

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       AC代码： #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int vis[20],a[20],n,sum=0; int prime(int x) {     if(x==1)     return 0;     if(x==2)     return 1;     for(int i=2; i*i<=x; i++)     if(x%i==0)     return 0;     return 1;  } void dfs(int x) {     if(x>n)     {         for(int i=1; i<=n-1; i++)         printf("%d ",a[i]);         printf("%d",a[n]);         printf("\n");         return ;     }     for(int i=2; i<=n; i++)     {         if(!vis[i]&&prime(i+a[x-1]))          {             if(x==n)             {                 if(prime(i+1))                 {                     a[x]=i;                     vis[i]=1;                     dfs(x+1);                     vis[i]=0;                 }             }             else             {                 a[x]=i;                     vis[i]=1;                     dfs(x+1);                     vis[i]=0;             }         }     }     return ;  }  int main() {     while(scanf("%d",&n)!=EOF)     {     sum++;     memset(vis,0,sizeof(vis));     memset(a,0,sizeof(a));     a[1]=1,vis[1]=1;     printf("Case %d:\n",sum);     dfs(2);     printf("\n"); } return 0; }