HDU 1016 Prime Ring Problem dfs

Prime Ring Problem

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

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

ACcode：

#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 100
using namespace std;
bool judge[maxn];
int my[maxn];
bool is[maxn];
int n;
int loop=1;
void init(){
    memset(judge,false,sizeof(judge));
    judge[2]=judge[3]=judge[5]=judge[7]=1;
    judge[11]=judge[13]=judge[17]=judge[19]=1;
    judge[23]=judge[29]=judge[31]=judge[37]=1;
}
void dfs(int x){
    if(x==n+1){
        if(judge[my[n]+my[1]]){
            for(int i=1;i<n;++i)printf("%d ",my[i]);
            printf("%d\n",my[n]);
        }
        return;
    }
    for(int i=2;i<=n;++i)
        if(!is[i]&&judge[i+my[x-1]]){
            is[i]=1;
            my[x]=i;
            dfs(x+1);
            is[i]=0;
        }
}
int main(){
    init();
    while(~scanf("%d",&n)){
        printf("Case %d:\n",loop++);
        memset(is,0,sizeof(is));
        my[1]=1;
        is[1]=1;
        dfs(2);
        printf("\n");
    }
    return 0;
}