hdu 1016 Prime Ring Problem 素数环

最新推荐文章于 2019-07-09 01:02:49 发布

原创最新推荐文章于 2019-07-09 01:02:49 发布 · 278 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

搜索

本文介绍了一种寻找特定排列的方法，使得环形排列中的每一对相邻数字之和都是素数。通过递归搜索和素数判断，实现了对于给定数量的节点找到所有可能的排列方案，并按字典序输出。

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<stdio.h>
#include<string.h>
#include<math.h>
int a[100],v[100];
int n;
int fun(int x)
{
    for(int i=2; i<x; i++)
    {
        if(x%i==0)
            return 0;
    }
    return 1;
}
void dfs(int x)
{
    if(x==n&&fun(a[0]+a[n-1])) //注意不要忘了判断第一个和最后一个
    {
        printf("%d",a[0]);
        for(int i=1; i<n; i++)
            printf(" %d",a[i]);
        printf("\n");
    }
    for(int i=2; i<=n; i++)
    {
        if(v[i]==0&&fun(i+a[x-1])) //相邻两个数相加为素数
        {
            a[x]=i;
            v[i]=1;
            dfs(x+1);
            v[i]=0;
        }
    }

}
int main()
{
    int un=0;
    while(~scanf("%d",&n))
    {
        printf("Case %d:\n",++un);
        memset(a,0,sizeof(a));
        memset(v,0,sizeof(v));
        a[0]=1; 
        dfs(1);
        printf("\n");
    }
    return 0;
}