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)

 

 

Recommend

JGShining

 

答案：

bool vist[20];
int  value[20];
int  n;

bool IsLegal(int a, int b)
{
 int i, k = 0;
 int v = a+b;
 for (i = 1; i <= v; ++i)
 {
  if ((a+b)%i == 0)
   ++k;
 }
 if (k <= 2)
  return true;
 return false;
}

void init()
{
 for (int i = 1; i <= n; ++i)
  vist[i] = false;
}

void calculate(int v, int m)
{
 if (m == 1)
 {
  value[n-m+1] = v;
  if (IsLegal(v, 1))
  { 
   int i;
   for (i = 1; i < n; ++i)
    printf("%d ", value[i]);
   printf("%d/n", value[n]);
  }
 }
 else
 {
  vist[v] = true;
  value[n-m+1] = v;
  for (int i = 1; i <= n; ++i)
  {
   if (!vist[i]&&IsLegal(v, i))
    calculate(i, m-1);
  }
  vist[v] = false;
 }
}

int main(int argc, char* argv[])
{
 int k = 0;
 
 while (scanf("%d", &n)!=EOF)
 {
  if (n < 0 || n > 20)
   break;
  
  printf("Case %d:/n", ++k);
  init();
  calculate(1, n);
  printf("/n");
 }
 
 return 0;
}