HDU1016 Prime Ring Problem

Prime Ring Problem

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

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
  
  

        一个很简单的深搜，每次搜索到最后一个的时候判断一下最后一个数加一是否是素数即可。

#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
using namespace std;
int v[25],n,k = 1;
int p[21];
void dfs(int d,vector<int>&s);
int main()
{
    for(int i = 2;i < 100;i++){
        if(!p[i]){
            for(int j = i+i;j < 100;j+=i)
                p[j] = 1;
        }
    }
    p[0] = p[1] = 1;
    while(cin>>n){
        vector<int>q;
        cout<<"Case "<<k++<<":"<<endl;
        memset(v,0,sizeof(v));
        q.push_back(1);
        v[1] = 1;
        dfs(1,q);
        printf("\n");
    }
    return 0;
}
void dfs(int d,vector<int>&s){
  if(d==n&&!p[s[n-1]+1]){
    for(int i = 0;i < n;i++){
        printf("%d",s[i]);
        if(i!=n-1)
            printf(" ");
    }
    printf("\n");
    return;
  }
  for(int j = 2;j <= n;j++){
        if(!v[j]&&!p[j+s[d-1]]){
            v[j] = 1;
            s.push_back(j);
            dfs(d+1,s);
            v[j] = 0;
            s.pop_back();
        }
  }
}