Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43799 Accepted Submission(s): 19404
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.
Note: the number of first circle should always be 1.
![](https://i-blog.csdnimg.cn/blog_migrate/427b1dd2282412709d583cc17eda983e.gif)
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.
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
tip:简单搜索.
#include<iostream>
#include<cstring>
using namespace std;
int n;
int book[25];
int a[25];
int prime[50];
int cnt=1;
void isprime()
{
memset(prime+2,1,sizeof(prime));//不是1但是一个非零值
for(int i=2;i<=50;i++)
{
if(prime[i])
{
for(int j=i+i;j<=50;j+=i)
prime[j]=0;
}
}
}
void dfs(int index)
{
if(index==n)
{
if(prime[a[n]+1])
{
cout<<a[1];
for(int i=2;i<=n;i++)
cout<<" "<<a[i];
cout<<endl;
return;
}
}
for(int i=1;i<=n;i++)
{
if(!book[i]&&prime[a[index]+i])
{
a[index+1]=i;
book[i]=1;
dfs(index+1);
book[i]=0;
}
}
}
int main()
{
while(cin>>n)
{
memset(book,0,sizeof(book));
a[1]=1;
book[1]=1;
isprime();
cout<<"Case "<<cnt++<<":"<<endl;
dfs(1);
cout<<endl;
}
return 0;
}