NSOJ Prime Ring Problem

Prime Ring Problem

时间限制: 2000ms

内存限制: 32768KB

HDU       ID:  1016
64位整型:      Java 类名:

上一题 

 提交   运行结果   统计   讨论版

  下一题

类型: 

没有

  没有

 难度

     lv.1

     lv.2

      lv.3

     lv.4

      lv.5

     lv.6

      lv.7

     lv.8

      lv.9

     lv.10

  搜索

 数据结构

  动态规划

 STL练习

  高精度计算

 图论

  几何

 数学

 矩阵计算

 入门题目

 字符串

 博弈论

                   添加

题目描述

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.

输入

n (0 < n < 20).

输出

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.

样例输入

6
8

样例输出

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

来源

Asia 1996, Shanghai (Mainland China)

思路：这个题是个比较水的搜索题，用深搜，但是需要注意，只有偶数才可以构成圈，不过1比较特殊，1自己就可以构成一个圈。

#include<stdio.h>
#include<string.h>
#include<math.h>
int a[21],n,flag,prime[41],book[21];
void dfs(int step)
{
    if(step==n&&prime[a[step-1]+1])
    {
        printf("1");
        for(int i=1; i<step; i++)
            printf(" %d",a[i]);
        printf("\n");
       return ;
    }
    for(int i=2; i<=n; i++)
    {
        if(!book[i]&&prime[a[step-1]+i])
        {
            book[i]=1;
            a[step]=i;
            dfs(step+1);
            book[i]=0;
        }
    }
}
int main()
{
    int i,j,k;
    for(i=2; i<40; i++)
    {
        k=sqrt(i);
        for(j=2; j<=k; j++)
            if(i%j==0)
                break;
                if(j>k)
                    prime[i]=1;
                else prime[i]=0;
    }
    k=1;
    while(~scanf("%d",&n))
    {
        memset(book,0,sizeof(book));
        if(n==1)
        {
          printf("Case %d:\n",k++);
           printf("1\n");
        }
        else if(n%2)
            continue;
        else { printf("Case %d:\n",k++);
        a[0]=1;
        dfs(1);}
        printf("\n");
    }
    return 0;
}