HDU 1016

最新推荐文章于 2019-02-02 19:56:12 发布

E_Windrunner

最新推荐文章于 2019-02-02 19:56:12 发布

阅读量1.1k

点赞数

分类专栏： HDU Graph 文章标签： c

本文链接：https://blog.csdn.net/e_windrunner/article/details/7324254

版权

HDU 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

Graph

46 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<string.h>
int n,ans[21],isprime[]={0,0,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,0},vis[21];
void dfs(int step)
{
    int i;
    if(step==n+1)
    {
        if(isprime[ans[n]+1])
            for(i=1;i<=n;i++)
                printf("%d%c",ans[i],i==n?'\n':' ');
    }
    else
        for(i=2;i<=n;i++)
            if(!vis[i]&&isprime[i+ans[step-1]])
            {
                ans[step]=i;
                vis[i]=1;
                dfs(step+1);
                vis[i]=0;
            }
}
int main()
{
    int count;
    count=0;
    while(scanf("%d",&n)!=EOF)
    {
        count++;
        ans[1]=1;
        memset(vis,0,sizeof(vis));
        printf("Case %d:\n",count);
        dfs(2);
        printf("\n");
    }
}