HDU 1016 Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27785 Accepted Submission(s): 12345
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
思路分析
题目的意思是说给你一个1、2、3......n的等差数列,以1为起点,按顺时针方向排列数字,每个数字只能出现一次并且相邻的两个数之和是一个素数,求其排列。
典型的一个DFS,即一个一个的往下判断,不符合时就往上退。用递归写时需要弄清楚进入递归和退出递归的关系以及退出递归后要把节点访问标记还原。这个题目还需要注意的地方就是答案可能有多个,因此,输出一个答案之后如何进行下一个不同答案的输出是需要斟酌的地方,
鉴于n最大值只到20,所以判断素数时可以通过打表然后直接查询来提高程序的运行速度。
代码如下
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
int n;
int a[25];
int visited[25];
bool IsPrime(int m)//判断素数
{
for (int i=2;i<=sqrt(m);i++)
if (m%i == 0)
return 0;
return 1;
}
void DFS(int j)
{
int i;
if (j == n && IsPrime(a[0]+a[j-1]))//必须满足首尾之和也为素数
{
cout<<a[0];
for (int k=1;k<n;k++)
cout<<" "<<a[k];
cout<<endl;
}//输出一个答案后会进行下面的判断(此时visited数组全为1,所以一直往上一个递归上退,并把原来访问的标记还原同时判断是否符合条件)
for (i=2;i<=n;i++)
if (visited[i] == 0 && IsPrime(a[j-1]+i))
{
a[j]=i;
visited[i]=1;
DFS(j+1);
visited[i]=0;//退出上一个递归,并把不符合的节点“弹出”
}
}
int main()
{
int cas=1;
while (scanf("%d",&n) != EOF)
{
a[0]=1;
memset(visited,0,sizeof(visited));
printf("Case %d:\n",cas++);
DFS(1);
cout<<endl;
}
return 0;
}