Prime Ring Problem UVA
来源:互联网 发布:c语言优先级排序 编辑:程序博客网 时间:2024/06/02 02:57
问题类型:DFS枚举+回溯。
问题链接、
03pie’s solution for [UVA-524]:
#include<iostream> #include<cstring>#include<cmath>using namespace std;const int maxn=16+1;int vst[maxn];int ans[maxn];bool isp(int n){ for(int i=2;i<=(int)sqrt(n);i++) if(n%i==0) return false; return true;}void dfs(int n,int pos){ if(pos==n&&isp(ans[0]+ans[n-1])){ for(int i=0;i<n-1;i++) cout<<ans[i]<<" "; cout<<ans[n-1]<<endl; } else for(int i=2;i<=n;i++) if(!vst[i]&&isp(i+ans[pos-1])){ vst[i]=1; ans[pos]=i; dfs(n,pos+1); vst[i]=0; }}int main(){ int n,kase=0; while(cin>>n){ if(kase)cout<<endl; cout<<"Case "<<++kase<<":"<<endl; memset(vst,0,sizeof(vst)); memset(ans,0,sizeof(ans)); ans[0]=1; dfs(n,1); } return 0;}
阅读全文
0 0
- Prime Ring Problem UVA
- Prime Ring Problem UVA
- Prime Ring Problem UVA
- UVA 524 - Prime Ring Problem
- uva 524 - Prime Ring Problem
- uva 524 Prime Ring Problem
- UVa:524 Prime Ring Problem
- uva 524 - Prime Ring Problem
- UVa 524 - Prime Ring Problem
- uva 724 Prime Ring Problem
- UVA - 524 Prime Ring Problem
- UVa-524 - Prime Ring Problem
- UVA - 524 Prime Ring Problem
- UVa - 524 - Prime Ring Problem
- UVA - 524 Prime Ring Problem
- uva 524Prime Ring Problem
- uva 524 - Prime Ring Problem
- Prime Ring Problem(UVA 524)
- Leetcode022. Generate Parenthesest
- 毕向东java上课笔记ArrayListTest2
- Android性能调优
- 双链表
- Heavy Transportation(POJ-1797)
- Prime Ring Problem UVA
- (OK) FEP
- Java调用热敏票据打印机打印小票
- 关于依赖服务或组无法启动解决方案解析
- java数据结构和算法-3,希尔排序
- c程序2
- ELK架构
- c++运算符重载
- [jbb0523整理]压缩感知中的数学知识:NP-hard问题