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
  
  

素数环，将从1到n的数串成一个环，要求相邻两数之和为素数，注意首和尾之和也是素数

#include<iostream>
#include<cstdio>
using namespace std;
int a[50]={0};//判断素数
int b[25];//存环
int c[21]={0};//判断是否使用过
int n;
void sc()//输出
{
    for(int i=1;i<n;i++)
        printf("%d ",b[i]);
    printf("%d\n",b[n]);
}
void dfs(int m)
{
    if(m==n+1)
    {
         sc();
         return;
    }
    for(int i=2;i<=n;i++)
    {
        if(c[i]==0)
        {
            if(m==n)//最后一位
            {
                int t=b[m-1]+i,u=1+i;
                if(a[t]==0&&a[u]==0)
                {
                    b[m]=i;
                    c[i]=1;
                    dfs(m+1);
                    c[i]=0;
                }
            }
            else
            {
                int t=b[m-1]+i;
                if(a[t]==0)
                {
                    b[m]=i;
                    c[i]=1;
                    dfs(m+1);
                    c[i]=0;
                }
            }
        }

    }
}
int main()
{
   b[1]=1;
   for(int i=3;i<=40;i++)
   {
       for(int j=2;j<=i/2;j++)
       {
           if(i%j==0)
            a[i]=1;
       }
   }
   int y=0;
   while(cin>>n)
   {
       y++;
       printf("Case %d:\n",y);
       dfs(2);
       printf("\n");
   }
}