HDOJ Prime Ring Problem (深度优先搜索)

探讨如何利用深度优先搜索算法解决HDOJ中的素数环问题,详细阐述问题背景及解题思路。
摘要由CSDN通过智能技术生成

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11488    Accepted Submission(s): 5194


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
 


#include <iostream>
#include <cstring>

using namespace std;

int n,j,k=1,visit[20],a[20]={1};
int prime[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 m)
{
	if(m==n && prime[1+a[n-1]])
	{
		for(int i=0;i<n-1;i++)
			cout<<a[i]<<" ";
		cout<<a[n-1]<<endl;	
	}
	
	else
	{
		for(int i=2;i<=n;i++)
		{
			if(prime[i+a[m-1]] && !visit[i])
			{
				a[m]=i;
				visit[i]=1;
				DFS(m+1);
				visit[i]=0;	
			}	
		}	
	}	
}

int main()
{	
	while(cin>>n)
	{
		memset(visit,0,sizeof(visit));
		cout<<"Case "<<k++<<":"<<endl;
		DFS(1);
		cout<<endl;
	}
	
	return 0;	
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值