hdoj 1016 Prime Ring Problem

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35064    Accepted Submission(s): 15519

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
  
  
  
  


  
  
  
  

   
   dfs 
  
  
  
  
 
   
   
#include<stdio.h>
#include<string.h>
#include<math.h>
#define N 100
int visit[N],a[N];
int prime(int x)//判断素数 
{
	if(x==2||x==3)
	return 1;
	if(x==1)
	return 0;
	int i,j;
	for(i=2;i*i<=x;i++)
	if(x%i==0)
	return 0;
	return 1; 
}
void dfs(int num,int  n)
{
	int i;
	if(num>=n+1&&prime(a[n]+1))//是否数量到n 且，首尾相加是素数 
	{
		for(i=1;i<n;i++)
		 {
		 	printf("%d ",a[i]);
		 }
		 printf("%d\n",a[n]);
		 return ;
	}
	else
	{
	for(i=2;i<=n;i++)//搜素 
	 {
	 	if(!visit[i]&&prime(a[num-1]+i))
	 	{
	 		visit[i]=1;
	 		a[num]=i;
	 		dfs(num+1,n);
	 		visit[i]=0;
		 }	
	 }return ;
     }
	 
}
int main()
{
   int n,j=1;
   while(scanf("%d",&n)!=EOF&&n!=0)
   {
   	int i;
   	  for(i=1;i<=n;i++)
   	   {
   	   	 a[i]=0;
   	   	 visit[i]=0;
	   }
	   a[1]=1;visit[1]=1;
	   printf("Case %d:\n",j++);
	   if(n&1)
	   {
	   	 if(n==1)
	   	 printf("1\n");
	   	 else
	   	 printf("No Answer\n");
	   }
	   else
	   {
	   	dfs(2,n);
	   	printf("\n");
	   }
   }
   return 0;
}