素数环

问题描述：<杭电1016>
Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 39510 Accepted Submission(s): 17415

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的排列，cur记录当前选择的第几个数。在遍历过程中满足不重复且为素数则进入下一个位置cur+1。直到cur==n。
代码：

#include <iostream>
#include <cmath>
using namespace std;

const  int MAXN = 30;
int a[MAXN];

int check(int cur,int n);
void PrimeCircle(int cur,int n);

int main()
{
    int n,i=1;
    while(cin>>n && n>0)
    {
        cout<<"Case "<<i++<<":"<<endl;
        a[0]=1;
        PrimeCircle(1,n);
        cout<<endl;
    }
    return 0;
}

void PrimeCircle(int cur,int n)
{
    if(cur == n)
    {
        for(int i=0;i<n-1;i++)
            cout<<a[i]<<" ";
        cout<<a[n-1];
            cout<<endl;
            return ;
    }
    for(int i=2;i<=n;i++)
    {
        a[cur] = i;
        int ok = 1;
        for(int j=0;j<cur;j++)
        {
            if(a[j]==a[cur])
            {
                ok = 0;
                break;
            }
        }
        if(check(cur,n)==0)
            ok = 0;
        if(ok)
        {
           PrimeCircle(cur+1,n);
        }
    }
}

int check(int cur,int n)
{
    int flag =1;
    int m = a[cur] + a[cur-1];
    int t = sqrt(m);
    for(int i=2;i<=t;i++)
    {
        if(m%i==0)
        {
            flag = 0;
            break;
        }
    }
    if(cur == n-1)
    {
        m = a[cur] + a[0];
        t =sqrt(m);
        for(int i=2;i<=t;i++)
        {
            if(m%i==0)
            {
                flag = 0;
                break;
            }
        }
    }
    return flag==1?1:0;

}