Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 65765 Accepted Submission(s): 28162
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.
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
Source
Asia 1996, Shanghai (Mainland China)
Recommend
JGShining | We have carefully selected several similar problems for you: 1241 1312 1072 1242 1175
Statistic | Submit | Discuss | Note
心得:这道题是dfs,一开始一直对dfs优化,后来发现判断素数太花时间了,看了别人的博客才想到打表。
#include<bits/stdc++.h>
using namespace std;
int n,a[22],vis[22],b[22];
int ck[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0}; //枚举小于40就行,因为n=20。
void dfs(int step)
{
int i;
if(step==n+1)
{
if(ck[a[n]+a[1]])
{
for(i=1;i<n;i++) printf("%d ",a[i]);
printf("%d\n",a[i]);
}
return ;
}
for(i=2;i<=n;i++)
{
if(vis[i]==0&&ck[i+a[step-1]])
{
vis[i]=1;
a[step]=i;
dfs(step+1);
vis[i]=0;
}
}
return ;
}
int main(void)
{
int pt=1;
while(~scanf("%d",&n))
{
printf("Case %d:\n",pt++);
memset(vis,0,sizeof(vis));
memset(a,0,sizeof(a));
a[1]=1;
dfs(2);
printf("\n");
}
return 0;
}
参考文章:https://www.cnblogs.com/jiangjing/archive/2013/02/04/2891621.html