杭电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

 

 

代码实现：

#include<cstdio>
#include<iostream>
using namespace std;
int a[20],book[20],n;
int prime(int a)
{
    int flag=1,i;
    for(i=2;i<=(a/2);i++)
    {
        if(a%i==0)
         flag=0;
    }
    return flag;
}
void circle(int i)
{
    int j;
    for(j=2;j<=n;j++)
    {
        if(i>=n)
        return;
        if(prime(a[i-1]+j)&&book[j]==0)
        {
            book[j]=1;
            a[i]=j;
            i++;
            circle(i);
                
            if(i>=n&&prime(a[0]+a[n-1]))
            {
                int k=0;
                for(k=0;k<n;k++)
                {
                    cout<<a[k]<<" ";
                }
                cout<<endl;
            }
            book[j]=0;
            i--;
        }
    }
    return;
}
int main()
{
    int count=0;
    while(cin>>n)
    {
        count++;
        int i=1;
        memset(book,0,sizeof(book));
        a[0]=1;
        cout<<"Case "<<count<<":"<<endl;
        circle(1);
    }
    return 0;
}