hdu1016 Prime Ring Problem
2014-06-25 23:45
190 查看
题目链接:点击打开链接
素数环
回溯法
素数环
回溯法
#include <iostream> #include<stdio.h> #include<stdlib.h> #include<string.h> using namespace std; int a[21]; int visit[21]; int k=1; int is_prime(int n) { int i; for(i=2;i<=n;i++) { if(n%i==0) { break; } } if(i==n) { return 1; } else { return 0; } } void dfs(int cur,int n) { if(cur==n && is_prime(a[0]+a[n-1])) { int i; for(i=0; i<n-1; i++) { printf("%d ",a[i]); } printf("%d\n",a[i]); return; } for(int i=2;i<=n; i++) { if( !visit[i]&&is_prime(i+a[cur-1])) { visit[i]=1; a[cur]=i; dfs(cur+1,n); visit[i]=0; } } } int main() { int n; a[0]=1; while(cin>>n) { printf("Case %d:\n",k++); memset(visit,0,sizeof(visit)); dfs(1,n); printf("\n"); } return 0; }
相关文章推荐
- HDU1016 Prime Ring Problem
- Prime Ring Problem(HDU1016)(A)
- hdu1016-Prime Ring Problem 素数环
- hdu1016 Prime Ring Problem
- hdu1016 Prime Ring Problem(回溯dfs)
- HDU1016-Prime Ring Problem(DFS)
- hdu1016 Prime Ring Problem(回溯)
- HDU1016:Prime Ring Problem(DFS)
- HDU1016 Prime Ring Problem (经典的深搜)
- hdu1016-Prime Ring Problem(回溯法)
- HDU1016:Prime Ring Problem(dfs)
- HDU1016 Prime Ring Problem
- HDU1016 Prime Ring Problem(深度优先搜索)
- HDU1016 - Prime Ring Problem - dfs
- HDU1016 Prime Ring Problem DFS 简单题
- ACM 搜索 hdu1016 Prime Ring Problem
- HDU1016 Prime Ring Problem(素数环,深搜DFS)
- Hdu1016 Prime Ring Problem 【简单dfs】
- hdu1016 Prime Ring Problem
- hdu1016-Prime Ring Problem