Prime Ring Problem
来源:互联网 发布:360数据恢复软件比较差 编辑:程序博客网 时间:2024/05/21 15:02
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.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.Sample Input 6 8Sample 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
阅读全文
0 0
- 1016 Prime Ring Problem
- HDOJ1016-Prime Ring Problem
- HDU1016 Prime Ring Problem
- DFS__1195: Prime Ring Problem
- Prime Ring Problem
- 1016:Prime Ring Problem
- 1016 Prime Ring Problem
- HDUOJ1016 Prime Ring Problem
- 1016 Prime Ring Problem
- Prime Ring Problem
- hdu1016 Prime Ring Problem
- Prime Ring Problem(dfs)
- Prime Ring Problem
- Prime Ring Problem
- Prime ring problem
- hdu1016-Prime Ring Problem
- HDU1035 Prime Ring Problem
- 1016Prime Ring Problem
- IfFileExists(文件存在)+Goto实现简单跳转
- c# 利用ADODB连接ORACLE数据库
- C++——USACO Section 2.3 题解
- 一致性Hash算法
- WPF 后台图片绘制线段并生成本地图片文件
- Prime Ring Problem
- ch2 计算机的发展及应用
- Spark读文本将多行合并为一行
- QT5布局管理--停靠窗口QDock Widget
- Java中的多线程你只要看这一篇就够了
- hdu 5573 Binary Tree(传说中的构造)
- 安卓flex
- 2017七月、八月暑假集训总结
- 08.js.for循环