HDU: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

思路

典型的深度搜索（dfs）问题
开始我dfs采用的思路是选择性交换排序，

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>

using namespace std;

int isprime[55];
int n, vis[55];
int a[55];

void isPrime()
{
   
	int i, j;
	for (i = 0; i < 55; ++i)
	{
   
		isprime[i] = 1;
	}
	isprime[0] = isprime[1] = 0;
	for (i = 2; i <= 7; ++i)
	{
   
		if (isprime[i])
		{
   
			for (j = i * i; j <= 50; j += i)
			{
   
				isprime[j] = 0;
			}
		}
	}
}

void init()
{
   
	int i;
	for (i = 0; i < n; ++i)
	{
   
		a[i] = i + 1;
	}
}


bool check(int k)
{
   
	if (isprime[a[k % n] + a[k - 1]])
		return true;
	return false;
}

void dfs(int k)
{
   
	int i;
	int temp;
	if (k == n)
	{
   
		if (check(k))
		{
   
			for (i = 0; i < n - 1; ++i)
				printf("%d ", a[i]);
			printf("%d\n", a[i]);
		}
	}
	for (i = k; i < n; ++i)
	{
   
		{
   
			temp = a[i];
			a[i] = a[k];
			a[k] = temp;
			if (check(k))
				dfs