码迷,mamicode.com
首页 > 编程语言 > 详细

搜索算法acm

时间:2016-10-12 00:52:59      阅读:197      评论:0      收藏:0      [点我收藏+]

标签:

2016-10-11

21:18:45

HDU 1016

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

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

搜索算法acm

标签:

原文地址:http://www.cnblogs.com/zhou-love-coding/p/5951135.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!