HDU 1016 Prime Ring Problem

转载请注明出处：http://blog.csdn.net/a1dark

分析：直接DFS暴力搜索就行了、由于运行时间比较小就没去剪枝了、简单题不懂看代码

#include<stdio.h>
#include<string.h>
int map[25];
int vis[25];
int n,flag,cas;
int judge(int x){if(x%2==0)return 0;for(int i=2;i<=x/2;i++){if(x%i==0)return 0;}return 1;
}
void dfs(int cur){vis[1]=1;if(cur>n&&judge(map[n]+1)){if(flag==0){printf("Case %d:\n",cas);cas++;flag++;}for(int i=1;i<n;i++)printf("%d ",map[i]);printf("%d\n",map[n]);}else{for(int i=2;i<=n;i++){map[cur]=i;if(!vis[i]&&judge(map[cur]+map[cur-1])){vis[i]=1;dfs(cur+1);vis[i]=0;}}}
}
int main(){cas=1;while(scanf("%d",&n)!=EOF){if(n==1){printf("Case %d:\n",cas);cas++;printf("1\n");continue;}flag=0;memset(vis,0,sizeof(vis));memset(map,0,sizeof(map));map[1]=1;dfs(2);printf("\n");}return 0;
}

转载于:https://www.cnblogs.com/pangblog/p/3301808.html

HDU 1016 Prime Ring Problem相关推荐

HDOJ 1016 HDU 1016 Prime Ring Problem ACM 1016 IN HDU
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=1016 题目描述: Prime Ring Problem Time Limit: 4000/2000 ...
hdu 1016 Prime Ring Problem(DFS)
本题链接:点击打开链接本题大意: 输入一个数n表示须要查找的数有n个,而且这些数连成一个环,随意两个相邻的数之和都为素数. 解题思路: 就是从1開始对每一个点进行查找,符合条件的点就存到一个数组中, ...
hdoj - 1258 Sum It Up hdoj - 1016 Prime Ring Problem (简单dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1258 关键点就是一次递归里面一样的数字只能选一次. 1 #include <cstdio> 2 #i ...
【HDOJ】1016 Prime Ring Problem_天涯浪子_新浪博客
[题目]http://acm.hdu.edu.cn/showproblem.php?pid=1016 [报告] 素数环问题,要求相邻两个数的和是素数. 标准的暴力DFS问题,注意一下N=1的特殊情况. ...
HDU1016 Prime Ring Problem dfs+回溯
点击打开链接 Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Jav ...
UVA524 素数环 Prime Ring Problem
UVA524 素数环 Prime Ring Problem - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/UVA52 ...
UVA - 524：Prime Ring Problem
Prime Ring Problem 来源:UVA 题目 A ring is composed of n (even number) circles as shown in diagram. Put ...
UVA - 524 Prime Ring Problem
题目链接: UVA - 524 Prime Ring Problem Description(素数环) A ring is composed of n (even number) circles as ...
[HDOJ1016]Prime Ring Problem
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1016 原题: A ring is compose of n circles as shown in d ...
杭电 Prime Ring Problem
解题思路: 题目是一道很典型的dfs搜索题目,思路很清晰,很容易想到.想组成这个素数环,要有n步,而每步都有n-i(i是变动的)种可能,所以利用dfs深搜,并融合回溯法,这一步搜不到的话既返回至上一步 ...

HDU 1016 Prime Ring Problem

HDU 1016 Prime Ring Problem相关推荐

最新文章

热门文章