HDU1016(dfs)
来源:互联网 发布:知乎 angelababy 编辑:程序博客网 时间:2024/06/07 06:58
Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14715 Accepted Submission(s): 6720
Problem Description
A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.
Note: the number of first circle should always be 1.
Note: the number of first circle should always be 1.
Input
n (0 < n < 20).
Output
The output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order.
You are to write a program that completes above process.
Print a blank line after each case.
You are to write a program that completes above process.
Print a blank line after each case.
Sample Input
68
Sample Output
Case 1:
1 4 3 2 5 61 6 5 2 3 4
Case 2:
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2
Source
Asia 1996, Shanghai (Mainland China)
分析:
(1)这道题非常类似于N皇后问题,使用的是深度优先搜索方法
(2)虽然说打印要求是按照顺时针和逆时针顺序打印,其实按照从小到大的搜索顺序搜索后的结果就是符合输出顺序的。
(3)由于是20以内的数字,所以判断质数的方法是直接打表后一个简单的循环判断一下是否为质数
(4)程序中mark数组是为了标记某个数字是否使用过了,num数组存储的是数字链表的存储顺序。
#include <stdio.h>int num[21],mark[21],n;int prime_num[12] = {2,3,5,7,11,13,17,19,23,29,31,37};//判断是否是质数,是返回1,不是返回0int is_prime(int a){ for(int i = 0; i < 12;i++) if(a==prime_num[i])return 1; return 0;}void print_num(){ for(int i = 1; i < n;i++) printf("%d ",num[i]); printf("%d",num[n]);}int dfs(int pre,int post,int flag){ //如果不符合,直接返回 if(!is_prime(pre+post)) return 0; num[flag] = post; if(flag==n&&is_prime(post+1)) { print_num(); printf("\n"); return 1; } //使用过了这个数字就标记为0 mark[post] = 0; for(int i = 2;i<=n;i++) if(mark[i]!=0 && dfs(post,i,flag+1))break; //标记位恢复原状 mark[post] = 1; return 0;}int main(){ int count; count = 1; while(scanf("%d",&n)!=EOF) { for(int i = 1; i <= n; i++) mark[i] = i; num[1] = 1; printf("Case %d:\n",count++); if(n==1)printf("1\n"); for(int i = 2;i<=n;i++) dfs(1,i,2); printf("\n"); } return 0;}
阅读全文
0 0
- HDU1016(dfs)
- hdu1016--dfs
- HDU1016 DFS
- HDU1016(DFS)
- hdu1016(dfs)
- HDU1016 DFS
- HDU1016-Prime Ring Problem(DFS)
- hdu1016(Prime Ring Problem)- dfs+枚举
- hdu1016 Prime Ring Problem(dfs)
- hdu1016 Prime Ring Problem(dfs)
- nyoj488&&hdu1016 素数环(DFS)
- hdu1016 Prime Ring Problem(回溯dfs)
- hdu1016 Prime Ring Problem(dfs)
- HDU1016 Prime Ring Problem (DFS)
- HDU1016 Prime Ring Problem(dfs)
- HDU1016:Prime Ring Problem(dfs)
- hdu1016素数环(DFS)
- HDU1016-经典DFS
- react 动态操作className
- NUMECA_FINE_V8.6.1 世界最著名的泵轮、叶轮、螺旋桨等的叶片分析及飞机机翼空气动力学分析\
- dasdsd
- 回调函数
- Sophix移动热修复之在AndroidStudio项目集成SDK(一)
- HDU1016(dfs)
- 不再纠结前置++与后置++
- Qrcode二维码生成
- 标准I/O
- 51Nod 1475 建设国家
- pugixml使用
- html中 label里for属性和form属性
- Opencv图像变灰处理(纯C++,不依赖Opencv Manager)
- LIST、MAP、SET总结