hdu 1016素数环

最新推荐文章于 2019-05-31 12:34:01 发布

too_young-_-

最新推荐文章于 2019-05-31 12:34:01 发布

阅读量560

点赞数

分类专栏：图论_dfs

本文链接：https://blog.csdn.net/u013653310/article/details/24603515

版权

图论_dfs 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

百度之星编程大赛——您报名了吗？
杭电ACM 2014暑期集训队——选拔安排~

Prime Ring Problem

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

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 | We have carefully selected several similar problems for you: 1072 1253 1026 1015 1258

题意：就是给一个数n，然后从[1,n]中找出若干个序列输出，序列要求满足的条件：按顺序构成一个环，然后要求环上相邻的两个数相加和为素数。

#include<cstdio>  
#include<cstring>  
int prime[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0},n; //数组表示哪个数是素数，这个网上抄的  
int used[40],s[40];  
void dfs(int x)  
{  
    int i;  
    if( x==n && prime[s[x-1]+s[0]] )//表示环上已经有n个数，并且最后一个数和第一个数的和为素数。  
    {  
        for(i=0;i<x-1;i++)  
            printf("%d ",s[i]);  
        printf("%d\n",s[i]);//输出符合条件的环。  
    }  
    else   
    {  
        for(i=2;i<=n;i++)  
        {  
            if(used[i]==0)表示这个数还没有用过  
            {  
                if(prime[i+s[x-1]])//表示相邻的两个数相加和为素数，加到数组中，并进行下一层dfs。  
                {  
                    used[i]=-1;//把这个数标记为已经用过。  
                    s[x++]=i;//把这个数加到数组里。  
                    dfs(x);  
                    used[i]=0;//如果搜索不成功，则返回这一层，然后继续执行下面的语句，并将数i还原为没有用过的状态。  
                    x--;//还原，表示数组中现在有 x-- 个数。  
                }  
            }  
        }  
    }          
}  
int main()  
{  
    int i=0;  
    while(scanf("%d",&n)!=EOF)  
    {  
        i++;  
        printf("Case %d:\n",i);  
        memset(used,0,sizeof(used));  
        s[0]=1;  
        dfs(1);  
        printf("\n");  
    }  
return 0;  
}