uva 524 Prime Ring Problem
来源:互联网 发布:数据库 经典公开课 编辑:程序博客网 时间:2024/06/05 14:31
题目:Prime Ring Problem
题意:求长度为n的素数环。
思路:dfs,枚举每一位上的值。
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<vector>using namespace std;bool Prime[33]={0,1,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};int n;vector<int> vec;int use[33]={0};void dfs(int x){if(x==n){if(!Prime[vec[vec.size()-1]+1]) return ;printf("1");for(int i=1;i<vec.size();i++){printf(" %d",vec[i]);}printf("\n");return ;}for(int i=2;i<=n;i++){if(!use[i]&&Prime[vec[x-1]+i]){use[i]=true;vec.push_back(i);dfs(x+1);use[i]=false;vec.pop_back();}}}int main() {int T=0;while(scanf("%d",&n)==1) {if(T!=0) printf("\n");vec.clear();vec.push_back(1);printf("Case %d:\n",++T);dfs(1);}return 0;}
阅读全文
3 0
- 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 - 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)
- UVA - 524 Prime Ring Problem
- UVA - 524 Prime Ring Problem
- UVa 524 Prime Ring Problem
- UVA 524 Prime Ring Problem
- mysql语句总结3
- C# .Net代码审查清单
- 接口获取图片文件流的缓存问题
- spring框架概述
- mybatis返回主键
- uva 524 Prime Ring Problem
- matlab的czt()函数实现频率细化的实例
- java增强型for循环(三种遍历集合方式)
- 跨集群的kafka相关错误
- VS 快捷键 操作介绍
- 【CodeForces
- MySQL 中的数据类型介绍
- mysql(十三)日志详细解析
- 并查集—应用