no tags 

You will be given a 2-dimensional grid of letters. Find the length of the longest path of consecutive letters, starting at 'A'. Paths can step from one letter in the grid to any adjacent letter (horizontally, vertically, or diagonally).

For example, in the following grid, there are several paths from 'A' to 'D', but none from 'A' to 'E':


One such path is:



Each test case will start with a line contains two integers H, W the height and width of the grid respectively 1 <= H, W <= 50. Then H lines follow each of W uppercase letters only. Input terminates with H = 0 and W = 0.


For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.


Sample Input:
4 3
0 0

Sample Output:
Case 1: 4

hide comments
xamitksx: 2016-03-21 09:50:43

Basic recursion...

Ankit Kumar: 2016-03-08 07:19:18

i am getting can anybody help.

enigmus: 2016-03-01 15:18:18

Don't bother solving it in Python. Time limit is strict, although interestingly I see some Python solutions got AC

Last edit: 2016-03-01 15:22:44
marky: 2016-03-01 12:09:07

OP Formar -> Case 1: 4

Wumbolo: 2016-02-14 18:46:46

easy bfs > 0.00. 50th on spoj :)

aditiwari: 2016-02-03 19:41:44

plain memoization: 0.00 :)

KUNDAN KUMAR: 2016-01-31 18:19:23

Can anybody list these four paths , how the output is coming four.

lakshay_v06: 2016-01-24 08:28:53

DFS -> 0.01 :)

BRAIN: 2015-12-31 12:03:53

Case_1:_4 <- wrong output
Case 1: 4 <- true output
It gives me 5 wrong answer :((((((( bad day

sunil: 2015-12-26 16:39:42

finally ac: using DP

Added by:Ali Arous
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS Local Contest 2012