hdu 1016 Prime Ring Problem

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1016

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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

一道简单的dfs搜索题，要注意的地方就是递归结束的条件，还有回溯的时候要记得重置。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

#define maxn 110
#define ll long long
#define inf 0x3f3f3f3f

int n;
int vis[110],a[110];

int f(int x)             //判断素数
{
    for(int i=2; i*i<=x; i++)
    {
        if(x%i==0) return 0;
    }
    return 1;
}

void dfs(int m)
{
    if(n==m&&f(1+a[m]))   //当搜索到最后一个的时候，判断第一个和最后一个是否互质，如果互质就可以输出。
    {
        cout<<a[1];
        for(int i=2; i<=n; i++)
            cout<<" "<<a[i];
        cout<<endl;
    }
    else
    {
        for(int i=2; i<=n; i++)
        {
            if(f(a[m]+i)==1&&vis[i]==0)
            {
                a[m+1]=i;
                vis[i]=1;
                dfs(m+1);
                vis[i]=0;      //回溯
            }
        }
    }
}

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