回溯3 素数环

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 、

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

思路就是创建两个数组，一个用来保存环，一个用来判断每个数有没有重复利用。然后写一个判断素数函数和一个dfs。

#include<iostream>

using namespace std;

int arr[21];
bool bl[21];
int n;

bool isprime(int a)
{
	for(int i=2;i<=a/2;i++)
	{
		if(!(a%i)) return false;
	}
	
	return true; 
}

void dfs(int a)
{
	if(a>n&&isprime(arr[n]+arr[1]))
	{
		 cout<<"1";
		for(int i=2;i<=n;i++)
		cout<<" "<<arr[i];
		cout<<endl;
		return ; 
	}
	
	for(int i=2;i<=n;i++)
	{
		arr[a]=i;
		if(bl[i]&&isprime(arr[a]+arr[a-1]))
		{
			bl[i]=false;
			dfs(a+1);
			bl[i]=true;
		  }  
	}
}

int main(){
	int k=1;
	while(cin>>n)
	{
		
    	arr[1]=1;
	    for(int i=1;i<=n;i++)
	    bl[i]=true;
	    bl[1]=false;
	    cout<<"Case "<<k<<":"<<endl;
	    dfs(2); 
	    cout<<endl;
	    k++;
	    
	}

	
	
	return 0;
}