hdu1016-Prime Ring Problem(简单dfs)

Prime Ring Problem

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

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
  
  

 

  题意：给出一个N(0<N<20)，在1~N的所有排列中，满足相邻两个数之和是素数（头尾相邻）的排列输出。

  分析：一道很基础的dfs题，考虑到N的范围较小，素数可以直接打表完成。题目要求按照顺序输出，按照从小到大的顺序搜索就是符合输出顺序的，所以不必考虑。

代码如下

 

#include <stdio h=""> #include <string h=""> #include <algorithm> using namespace std; int su[12]={2,3,5,7,11,13,17,19,23,29,31,37}; int n,vis[21]/*标记是否用过该数字*/,num[21]; int Case=1; int prime(int a) { for(int i=0;i<12;i++) if(a==su[i]) return 1; return 0; } void dfs(int now,int fur,int flag) { if(!prime(now+fur)) { return; } if(flag==n) { if(prime(fur+1)) { num[n]=fur; for(int i=1;i<=n;i++) { i==n?printf("%d\n",num[i]):printf("%d ",num[i]); } } } else { vis[fur]=1; num[flag]=fur; for(int i=2;i<=n;i++) { if(!vis[i]) { dfs(fur,i,flag+1); vis[i]=0; } } } } int main() { while(~scanf("%d",&n)) { printf("Case %d:\n",Case++); for(int i=2;i<=n;i++) { vis[i]=0; } vis[1]=1; num[1]=1; if(n==1) printf("1\n"); else { for(int i=2;i<=n;i++) { dfs(1,i,2); for(int j=2;j<=n;j++) { vis[j]=0; } } } printf("\n"); } }</algorithm></string></stdio>