Prime Ring Problem(HDU-1016)

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
  
  

 

代码如下：

#include<bits/stdc++.h>
using namespace std;
int prime[50]={0,0},r[50]={1},n,vis[50]={0};
void dfs(int k)
{
    if(k==n-1&&prime[r[k]+r[0]])
    {
        for(int i=0;i<n-1;i++)
            cout<<r[i]<<" ";
        cout<<r[n-1]<<endl;
    }
    for(int i=2;i<=n;i++)
        if(!vis[i]&&prime[i+r[k]])
        {
            vis[i]=1;
            r[k+1]=i;
            dfs(k+1);
            vis[i]=0;
        }
}
int main()
{
    int t=1;
    for(int i=2;i<=40;i++)
    {
        prime[i]=1;
        for(int j=2;j*j<=i;j++)
            if(i%j==0)
            {
                prime[i]=0;
                break;
            }
    }
    while(cin>>n)
    {
        cout<<"Case "<<t<<":\n";
        dfs(0);
        cout<<endl;
        t++;
    }
    return 0;
}