poj 3050 Hopscotch【搜尋、去重】

<a target="_blank" href="http://poj.org/problem?id=3050">點選打開題目</a>

Hopscotch

Time Limit: 1000MS

Memory Limit: 65536K

Total Submissions: 2126

Accepted: 1524

Description

The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes. 

They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited). 

With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201). 

Determine the count of the number of distinct integers that can be created in this manner.

Input

* Lines 1..5: The grid, five integers per line

Output

* Line 1: The number of distinct integers that can be constructed

Sample Input

Sample Output

Hint

OUTPUT DETAILS: 

111111, 111112, 111121, 111211, 111212, 112111, 112121, 121111, 121112, 121211, 121212, 211111, 211121, 212111, and 212121 can be constructed. No other values are possible.

題目翻譯：給出一個5*5的矩陣，每一點都有一個數字，讓你分别從任意一個數字出發，向上下左右移動，移動6次，所走的路線組成一個字元串，

求：一共可以組成多少個不同的字元串？

結題思路：從每一個點開始搜尋，把每走六步的字元串轉化成數字放到set裡面，至于去重，交給神奇的set吧！