HDOJ1016 Prime Ring Problem（基础DFS）

Prime Ring Problem

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

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)

【分析】基础DFS

        素数环问题。

#include <stdio.h>
#include <math.h>
#include <string.h>
int n;
int a[25];
int vis[25];
int is_Prime(int n)
{
	int i;
	for(i=2;i<=sqrt(n);i++)
	{
		if(n%i==0)
			return 0;
	}
	return 1;
}
void dfs(int cur,int n)
{
	int i;
	if(cur==n)
	{
		if(is_Prime(a[0]+a[cur-1]))
		{
			for(i=0;i<cur-1;i++)
				printf("%d ",a[i]);
			printf("%d\n",a[cur-1]);
		}
		return;
	}
	for(i=2;i<=n;i++)
	{
		if(!vis[i] && is_Prime(a[cur-1]+i))
		{
			vis[i]=1;
			a[cur]=i;
			dfs(cur+1,n);
			a[cur]=0;
			vis[i]=0;
		}
	}
}
int main()
{
	int ncase=1;
	while(scanf("%d",&n)!=EOF)
	{
		memset(a,0,sizeof(a));
		memset(vis,0,sizeof(vis));
		printf("Case %d:\n",ncase++);
		a[0]=1;
		dfs(1,n);
		printf("\n");
	}
	return 0;
}