[回溯]Prime Ring Problem UVA524

Prime Ring Problem

A ring is composed of n (even number) circles as shown in diagram. Put natural numbers  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 <= 16)

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.

You are to write a program that completes above process.

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

很典型的回溯法求素数环问题，因为格式的问题WA了好几次。

#include<iostream>
#include<cstring>
#include<cmath>

using namespace std;

int n;
int num[20],vis[20];

bool isprime(int x)
{
    if(x<=3) return true;
    int y=(int)sqrt(x);
    for(int i=2;i<=y;i++)
    {
        if(x%i==0) return false;
    }
    return true;
}

void dfs(int pos)
{
    if(pos==n&&isprime(num[1]+num[n]))
    {
        for(int i=1;i<n;i++)
            cout<<num[i]<<" ";
        cout<<num[n]<<endl;
    }
    else
    {
        for(int i=2;i<=n;i++)
        {
            if(!vis[i]&&isprime(i+num[pos]))
            {
                num[pos+1]=i;
                vis[i]=1;
                dfs(pos+1);
                vis[i]=0;
            }
        }
    }
}

int main()
{
    int t=0;
    while(cin>>n)
    {
        memset(num,0,sizeof(num));
        memset(vis,0,sizeof(vis));
        num[1]=1;
        if(t!=0) cout<<endl;
        cout<<"Case "<<++t<<":"<<endl;
        dfs(1);
    }
    return 0;
}