杭电 １０１６

　

 

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"string.h"
#include"math.h"
using namespace std;
int n,a[21],b[21],num=0;
int sh(int x,int y)
{ 
	int i,z=x+y;
		if(z==2)
		return 1;
	for(i=2;i<=(int)sqrt(z)+1 ;i++)
		if(z%i==0)
			return 0;
		return 1;
}
int ff(int i)
{    int j;
	if(i==n+1)
	{  
		 
			 
			for(j=1;j<=n;j++)
			{
			
				cout<<b[j]<<" ";
			}
			cout<<endl;
			return 1;

		 
	}
	 
    for(j=2;j<=n;j++)
	{
		
		if(sh(j,b[i-1])&&a[j]==0)
		{
			if(i==n)
			{
                if(sh(1,j))
				{
                    a[j]=1;
					b[i]=j;
					ff(i+1);
					a[j]=0;
				}
			}
			else
			{
					a[j]=1;
					b[i]=j;
					ff(i+1);
					a[j]=0;
			}
		}
		
	}
  return 0;
}
int main()
{
	 freopen("input.txt","r",stdin);
	  freopen("output.txt","w",stdout);
    while(cin>>n )
	{
       b[1]=1;
	      
	   	cout<<"Case "<<++num<<endl;
		if(n>1)
	   ff(2);
	 cout<<endl;
	 memset(a,0,sizeof(a));
	 memset(b,0,sizeof(b));
	}
	 
	return 0;
} 
  
  
  
  

   
   不知道还有那里有错误，本地没检测出错误，但提交是总是有错误