Prime RingProblem
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
递归搜索。
#include<iostream>
using namespace std;
void dfs(int m);
int check(int m,int i);
void output();
int prime(int m,int n);
bool used[25]={false,true};
int circle[25]={1};
int n;
int main()
{
int t=1;
while(cin>>n)
{
cout<<"Case "<<t++<<":"<<endl;
dfs(1);
cout<<endl;
}
}
void dfs(int m)
{
if(m>=n)
output();
else
{
for(int i=2;i<=n;i++)
{
if(used[i]) continue;
if(check(m,i))
{
circle[m]=i;
used[i]=true;
dfs(m+1);
used[i]=false;
}
}
}
}
void output()
{
for(int i=0;i<n-1;i++)
cout<<circle[i]<<" ";
cout<<circle[n-1]<<endl;
}
int check(int m,int i)
{
if(m==n-1)
return prime(i,circle[m-1])&&prime(i,circle[0]);
else return prime(i,circle[m-1]);
}
int prime(int m,int n)
{
int num=m+n;
if(num==2) return 1;
if(num%2==0) return 0;
for(int i=3;i<num;i+=2)
if(num%i==0)
return 0;
return 1;
}