hdu 1016

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 60473    Accepted Submission(s): 26131

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

 

代码z

#include <iostream>
#include <cstdio>
using namespace std;
int a[20];
int n;
bool vis[20];
bool judge(int num)
{
   for(int i=2;i*i<=num;i++)
   {
       if(num%i==0)return false;
   }
   return true;
}
void dfs(int k)
{
    if(k>n&&judge(a[1]+a[n]))
    {
        for(int i=1;i<=n;i++)
            cout<<a[i]<<" ";
        return;
    }
    for(int i=2;i<=n;i++)
    {
        if(!vis[i]&&judge(i+a[k-1]))
        {
            vis[i]=true;
            a[k]=i;
            dfs(k+1);
            vis[i]=false; //回溯
        }
    }
}
int main()
{
    a[1]=1;
    while(~scanf("%d",&n))
    {
        cin>>n;
        dfs(2);
    }
}