HDU 1016 Prime Ring Problem 素数环

最新推荐文章于 2022-07-31 17:07:52 发布

原创最新推荐文章于 2022-07-31 17:07:52 发布 · 6.7k 阅读

3 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#numbers #each #output #input #测试

ACM 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一个关于环形排列的问题，即如何将1到n的自然数放置在由n个圆组成的环上，使得相邻两个圆上的数字之和为素数。通过回溯法（深度优先搜索）解决这一问题，并提供了完整的C++实现代码。

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

//回溯法（DFS遍历解答树）
#include<iostream>

using namespace std;

int n,cnt = 1;
int vis[21],A[21];
//素数表,加快后续判断
int primelist[38] = {0,0,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};

void dfs(int cur)
{
	if(cur == n && primelist[A[0] + A[n-1]])//递归边界,别忘了测试第一个数和最后一个数
	{
		cout << A[0] ;
		for(int i = 1;i < n;++i)
			cout << " "<< A[i];//此题的打印格式,注意,最后一个数字打印出来后不带空格
		cout <<endl;
	}
	else for(int i = 2;i <= n;++i)//尝试放置每一个数i
		if(!vis[i] && primelist[i + A[cur-1]])//如果u没有用过，并且与前面一个数之和为素数
		{
			A[cur] = i;//将该数放进A中
			vis[i] = 1;//设置使用标志
			dfs(cur + 1);//递归调用
			vis[i] = 0;//切记一定要将标志改回来,清除标志!
		}
}

int main()
{
	A[0] = 1;//1的位置不变
	while(cin >> n)
	{
		memset(vis,0,sizeof(vis));//标记数组清零
		cout << "Case " << cnt++ <<":/n";
		dfs(1);
		cout << endl;
	}

	return 0;
}