hdu 1016

Prime Ring Problem

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

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

分析：题目要求n个圈第一个圈内的数字一定为1，且符合任意相邻的两个圈内的数相加都为素数，给出所有可行的方法，并按照字典序输出答案。

           简单dfs：判出口，dfs，回溯

           话说这道题的测试数据都是有可行性方案的

代码：

//hdu 1016 prime ring 
#include <iostream>
using namespace std;
int vis[24],a[24];
int n;
int f[]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0, //41内素数
		  0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0};

void dfs(int k)
{
  if((k==n+1)&&(f[a[1]+a[n]])){              //先判出口
		for(int i=1;i<n;i++) cout<<a[i]<<" ";
		cout<<a[n]<<endl;
  }
  else{
	  for(int i=1;i<=n;i++){
		  if(vis[i]==0&&f[i+a[k-1]]){
			  vis[i]=1;
			  a[k]=i;
			  dfs(k+1);
			  vis[i]=0;                  //回溯
		  }
	  }
  }
}

int main()
{
  int cnt;
  cnt=1;
  while(cin>>n){  
      memset(vis,0,sizeof(vis));
      a[1]=1;vis[1]=1;      
	  cout<<"Case "<<cnt++<<":"<<endl; //测试数据都是有可行方案的
      dfs(2);
	  cout<<endl;
  }
  return 0;
}