Prime Ring Problem dfs

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

题目大意：要求一个数环，每个数字加上前或者后数字之和为素数，从1开始输出

起始状态就设为一开始搜索，边界条件是枚举到第n位时加上第一位判断一下

然后就是常规套路

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
int n;
bool visit[17];
int num[17];


int isp(int n)           
{
    if(n<2)
        return false;
    for (int i=2;i*i<=n; i++)
    {
        if(n % i == 0)
            return false;
    }
    return true;
}
void dfs(int pre,int step)
{
	if(step==n)
	{
		if(isp(num[1]+num[n])==1)
		{
			for(int i=1;i<n;i++)printf("%d ",num[i]);
			printf("%d\n",num[n]);
		}
		return; 
	}
	for(int i=1;i<=n;i++)
	{
		if(visit[i]==0)
		{
			if(isp(i+num[step])==1)
			{
				visit[i]=1;
				num[step+1]=i;
				dfs(i,step+1);
				visit[i]=0;
				//num[step+1]=0;
			}
		}
	}
}

int main()
{
	int t;
	while(scanf("%d",&n)!=EOF)
	{	
		memset(visit,0,sizeof(visit));	
		visit[1]=1;
		if(t!=0) printf("\n");
		t++;
		printf("Case %d:\n",t);
		num[1]=1;
		dfs(1,1);
	}
	return 0;
}