2055. Hopscotch

单点时限: 2.0 sec

内存限制: 256 MB

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.

输入格式

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

输出格式

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

样例

Input
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 2 1
1 1 1 1 1
Output
15
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.

15 人解决,29 人已尝试。

16 份提交通过,共有 33 份提交。

5.6 EMB 奖励。

创建: 13 年,2 月前.

修改: 3 年,6 月前.

最后提交: 3 月,2 周前.

来源: USACO

题目标签