  数据结构与算法-搜索(二)-递归

汉诺塔三 代码如下： 题目描述：

A ring is compose of n circles as shown in diagram.Put natural nuber 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.

n (1 < n < 17)

输出：

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 requirement.

Print solutions in lexicographical order.

You are to write a program that completes above process.

Print a blank line after each case

样例输出： 运行结果： 题目描述：

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposits. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

输入：

The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <=m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each( not counting the end-of-line characters). Each character corresponds to one plot, and is either ‘*’, representing the absence of oil, or ‘@’, representing an oil pocket.

输出：

For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent hozizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

样例输出： 运行结果： -------------本文结束感谢您的阅读-------------
0%