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
KUNDAN KUMAR:
20160131 18:19:23
Can anybody list these four paths , how the output is coming four.


lakshay_v06:
20160124 08:28:53
DFS > 0.01 :) 

BRAIN:
20151231 12:03:53
Case_1:_4 < wrong output


sunil:
20151226 16:39:42
finally ac: using DP 

wizdown:
20151220 11:02:33
prog.cpp:1:1: error: expected unqualifiedid before '<' token


Aditya Kumar:
20151218 06:38:14
really nice question Implemented BFS.


dhruv_iitj:
20151214 06:23:48
can the answer be AABCD... that is, can we have redundancy of letters??


Prateek Agarwal:
20151203 12:25:15
had to use memoization to get AC. 

arjun:
20151124 23:04:38
getting tle using dfs...any suggestions


arjun:
20151124 21:54:43
getting wa..cant think of any oter corner cases...need help..thanks

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 