HDU 1016-Prime Ring Problem(DFS)

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27595 Accepted Submission(s): 12271

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.

HDU 1016-Prime Ring Problem(DFS)

Input n (0
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.

Sample Input

6 8

Sample Output

Case 1: 1 4 3 2 5 6 1 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要求按字典序输出素数环。。DFS爆搜,不用剪枝。。一开始用 next_permutation()函数纯暴力判结果TLE了。。

#include #include #include #include #include #include #include #include #include #include #include #include #define L long long using namespace std; const int INF=0x3f3f3f3f; const int maxn=32; bool pri[100],vis[100]; int a[35],n; void init() { memset(pri,1,sizeof(pri)); pri[0]=0;pri[1]=0; for(int i=2;i

点击复制链接 与好友分享!回本站首页
您对本文章有什么意见或着疑问吗?请到论坛讨论您的关注和建议是我们前行的参考和动力
上一篇:UVA11402 - Ahoy, Pirates!(线段树)
下一篇:HDU 4856 Tunnels(bfs+状压dp)
相关文章

Max Sum &&http://acm.hdu.edu.cn/s

hdu 1003 Max Sum

HDU 4007

hdu1856并查集

HDU2094

hdu 1089 Robotic Sort

hdu 1754

HDU 4028

http://acm.hdu.edu.cn/showproblem.p

HDU 4022

图文推荐

HDU 1016-Prime Ring Problem(DFS)
ZOJ 3640 Help Me
HDU 1016-Prime Ring Problem(DFS)
CF 518C(Anya and
HDU 1016-Prime Ring Problem(DFS)
hdu 1016 Prime R
UVA - 11987 - A

分类:默认分类 时间:2015-03-01 人气:8
本文关键词:
分享到:

相关文章

Copyright (C) quwantang.com, All Rights Reserved.

趣玩堂 版权所有 京ICP备15002868号

processed in 0.029 (s). 10 q(s)