素数环——Prime Ring Problem

Prime Ring Problem

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<set>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1000005;
int ans[30];
int vis[30];
bool isprime(int n)//判断素数
{
    for(int i=2;i<n;i++)
        if(n%i==0) return false;
    return true;
}
int n;
void print()//输出结果
{
    for(int i=1;i<=n;i++)
        {
            cout<<ans[i];
            if(i==n) cout<<endl;
            else cout<<' ';
        }
}
void dfs(int k,int rt)
{
    if(rt==n&&isprime(k+ans[1]))//dfs的特点，一进来就判断是否return，判断返回的条件
    //位置已经放到第n个了并且当前这个与第一个放的之和不是素数
    {
        print();
        return ;
    }
    vis[k]=1;
    ans[rt]=k;//记录答案
    for(int i=1;i<=n;i++)
        if(!vis[i]&&isprime(i+k))//当前搜到的数是否符合要求
    {
        ans[rt+1]=i;//记录答案
        vis[i]=1;//标记已经访问
        dfs(i,rt+1);
        vis[i]=0;   //把搜过的点置为0，因为要搜出所有符合的结果
    }

}
int main()
{
    int cnt=1;
    while(scanf("%d",&n)!=EOF)
    {
        memset(ans,0,sizeof ans);
        memset(vis,0,sizeof vis);
        cout<<"Case "<<cnt++<<':'<<endl;
        dfs(1,1);
        cout<<endl;
    }
    return 0;
}