hdu 1016 Prime Ring Problem

                        Prime Ring Problem

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

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

两个相邻的数相加为素数 

code:

#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int n;
int vis[50];
int num[50];
int prime[1005];
/*
void init_prime()
{
	int i, j;
	for(i = 2;i <= sqrt(1000002.0); ++i)
	{
		if(!prime[i])
			for(j = i * i; j < 1000002; j += i)
				prime[j] = 1;
	}
	j = 0;
	for(i = 2;i <= 1000002; ++i)
		if(!prime[i]) 
			prime[i] = 1;
}*/
void is_prim()
{
    memset(prime,0,sizeof(prime));
    prime[0]=prime[1]=1;
    int sq=sqrt((double)40);
    for(int i=2;i<sq;i++)
        for(int j=i*i;j<40;j+=i)
            prime[j]=1;
}
void dfs(int s,int count)
{
	if(n<count&&!prime[num[1]+num[n]])
	{
		for(int i=1;i<=n;i++)
		{
			if(i!=n)
			cout<<num[i]<<" ";
			else
			cout<<num[i];
		}
		cout<<endl;
	}
	for(int i=1;i<=n;i++)
    {
    	if(!vis[i]&&!prime[s+i])
    	{
    		num[count]=i;//记录素数    
	    	vis[i]=1;
	    	dfs(i,count+1);
	    	vis[i]=0;
	    }
    }	
}
int main()
{
	int T=0;
	is_prim();
	while(cin>>n)
	{
		memset(vis,0,sizeof(vis));
		cout<<"Case "<<++T<<":"<<endl;
		
		num[1]=1;
		vis[1]=1;
		dfs(1,2);	
		
		cout<<endl;	
	}
	return 0;
}