ABCPATH  ABC Path
You will be given a 2dimensional 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:
Input
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.
Output
For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.
Example
Sample Input: 4 3 ABE CFG BDH ABC 0 0 Sample Output: Case 1: 4
hide comments
Vishal:
20160531 21:41:28
Starting with 'A' cost me three wrong answers Last edit: 20160531 21:41:44 

ajay_5097:
20160531 15:25:06
Used BFS => 4 TLE (memeory 701MB)


poojan :
20160430 16:47:47
Dfs+memo 

pvsmpraveen:
20160326 19:15:20
Dp 0.00 :) 

xamitksx:
20160321 09:50:43
Basic recursion... 

Ankit Kumar:
20160308 07:19:18
i am getting can anybody help. 

enigmus:
20160301 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: 20160301 15:22:44 

marky:
20160301 12:09:07
OP Formar > Case 1: 4 

Wumbolo:
20160214 18:46:46
easy bfs > 0.00. 50th on spoj :) 

aditiwari:
20160203 19:41:44
plain memoization: 0.00 :) 
Added by:  Ali Arous 
Date:  20111105 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  FCIS Local Contest 2012 