HDU 1016 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)

题意：给出一个数字，从1到n这n个数字形成一个环，要求奇数和偶数相间。对于一个数，有多少种情况就输出多少情况。

#include<stdio.h>
int a[20];
int book[20];
int n;
int fun(int x)                 用来判断奇偶性的函数。
{
    int i;
    for(i=2;i<x;i++)
    {
        if(x%i==0)
        {
            return 0;
        }
    }
    return 1;
}

void dfs(int step)
{
    int i;
    if(step>2)
    {
        if(fun(a[step-1]+a[step-2])==0)       同奇性或者同偶性，return；
            return ;
    }
    if(step==n+1)                          如果dfs到达n

    {
        int j=0;
        for(i=1;i<n;i++)
        {
            if(fun(a[i]+a[i+1])==1)          
                j++;
        }
            if(j==(n-1)&&fun(a[1]+a[n])==1)       判断结果，如果可以，则输出序列。
            {
               printf("%d",a[1]);
               for(i=2;i<=n;i++)
               {
                 printf(" %d",a[i]);
               }
                  printf("\n");
            }
                 return ;
    }
    for(i=2;i<=n;i++)

    {
        if(book[i]==0)          
        {
            a[step]=i;
            book[i]=1;
            dfs(step+1);
            book[i]=0;
        }
    }
    return ;
}
int main()
{
    int k=1;
    while(scanf("%d",&n)!=EOF)
    {
        a[1]=1;
        int i;
        for(i=1;i<=n;i++)
        {
            book[i]=0;
        }
        printf("Case %d:\n",k);
        dfs(2);
        k++;
        printf("\n");
    }
    return 0;
}