HDU-1016-Prime Ring Problem
来源:互联网 发布:志鸿优化官方商城 编辑:程序博客网 时间:2024/04/27 10:59
HDU-1016-Prime Ring Problem
http://acm.hdu.edu.cn/showproblem.php?pid=1016
基本的DFS,先打个素数表即可
#include<stdio.h>#include<string.h>#include<stdlib.h>int prime[50];int visit[30];int num[30];int n;void init(){ int i,j; memset(prime,0,sizeof(prime)); //标记0为素数,1为合数 for(i=3;i<=25;i+=2) if(prime[i]==0) { for(j=3*i;j<=50;j+=2*i) prime[j]=1; } for(i=4;i<=50;i+=2) prime[i]=1;}void dfs(int x){ int i; if(x==n+1&&prime[num[x-1]+1]==0) { for(i=1;i<=x-1;i++) printf(i==x-1?"%d\n":"%d ",num[i]); return; } for(i=2;i<=n;i++) if(!visit[i]) { if(prime[num[x-1]+i]==0) { num[x]=i; visit[i]=1; dfs(x+1); visit[i]=0; } } return;}int main(){ int t=1; init(); while(scanf("%d",&n)!=EOF) { printf("Case %d:\n",t++); if(n%2==1) { printf("\n"); continue; } memset(visit,0,sizeof(visit)); visit[1]=1; num[1]=1; dfs(2); printf("\n"); } return 0;}
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- HDU 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- HDU-1016 prime ring problem
- hdu 1016Prime Ring Problem
- hdu 1016 Prime Ring Problem
- HDU-1016 Prime Ring Problem
- HDU-1016-Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- Hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- Hdu 1016 - Prime Ring Problem
- HDU 1016 Prime Ring Problem
- POJ 计算几何入门题目推荐
- 正则表达式写法
- C#使用反射机制获取类信息
- DP<一维> 2058 龟兔赛跑
- 删除C/C++文件中的注释(c实现)
- HDU-1016-Prime Ring Problem
- 为钱编程 vs 为兴趣编程
- HDU 1890 Robotic Sort(Splay tree)
- C#内存操作 (转)
- 我要学编程,看什么书好?--^_^,这里推荐一些个人觉得很不错的书(二)
- Reverse 字符串
- WebSockets support in GlassFish 3.1 (and Grizzly)
- Extjs LoadMask
- C# 取MAC地址