Prime Ring Problem 搜索深度（简单回溯）

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)

#include <iostream>
#include <stdio.h>    
using namespace std;

int rem[22];
int visit[22];
int n,flag,k;

bool prime(int x,int y)
{
 int sum=x+y;
 int i;
 for(i=2;i*i<=sum;i++)
  if(sum%i==0)
   return false;
  return true;
}

void dfs(int ans)
{
 int i;
 visit[1]=1;
   if(ans>n&&prime(rem[n],rem[1]))
   {
            if(!flag)
   {
    printf("Case %d:\n",k);
                  flag=1;
   }
   for(i=1;i<n;i++)
    printf("%d ",rem[i]);
   printf("%d\n",rem[i]);
   }
    else
 {
  for(i=2;i<=n;i++)
  {
   rem[ans]=i;
   if(!visit[i]&&prime(rem[ans],rem[ans-1]))
   {
    visit[i]=1;
    dfs(ans+1);
    visit[i]=0;
   }
  }
 }
}
int main()
{
  k=0;
 while(~scanf("%d",&n))
 {
  k++;
  memset(visit,0,sizeof(visit));
  rem[1]=1;
  flag=0;
  dfs(2);
  printf("\n");
 }
 return 0;
}