hdu--1016 素素环(dfs)
2011-06-12 11:17
302 查看
#include "stdio.h" #include "string.h" #include "math.h" int visit[22],save[22]; int n,k=1,cur; int Isprime(int x) { int i; if(x==1||x==2) return 1; for(i=2;i<=sqrt(x);i++) { if(x%i==0) return 0; } return 1; } void DFS(int cur) { int i; if(cur==n&&Isprime(save[cur-1]+save[0])==1) { printf("%d",save[0]); for(i=1;i<n;i++) printf(" %d",save[i]); printf("/n"); } else for(i=2;i<=n;i++) if(!visit[i]&&Isprime(save[cur-1]+i)) { visit[i]=1; save[cur]=i; DFS(cur+1); visit[i]=0; } } int main() { save[0]=1; while(scanf("%d",&n)!=EOF) { memset(visit,0,sizeof(visit)); printf("Case %d:/n",k++); DFS(1); printf("/n"); } return 0; }
相关文章推荐
- hdu 1016 dfs
- hdu 1016 dfs+回溯
- HDU 1016 Prime Ring Problem DFS
- hdu 1016 Prime Ring Problem (dfs)
- HDU-1016(第一道DFS)
- hdu 1016 Prime Ring Problem dfs
- HDU 1016 dfs+回溯
- HDU 1016 Prime Ring Problem (DFS)
- [HDU-1016] 链表优化的DFS
- hdu 1016 Prime Ring Problem(dfs)
- HDU - 1016 Prime Ring Problem ——DFS
- HDU 1016 Prime Ring Problem【DFS】
- hdu 1016 Prime Ring Problem(DFS)
- HDU 1016 - Prime Ring Problem [简单DFS]
- hdu 1016 DFS
- HDU 1016 Prime Ring Problem(dfs)
- hdu 1016 素数环 经典dfs
- HDU 1016 Prime Ring Problem(DFS入门)
- HDU 1016 Prime Ring Problem (经典DFS)
- hdu 1016 Prime Ring Problem(DFS)