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
akt_114:
20200619 20:55:47
If you're getting TLE, use memoization :) 

czhang2718:
20200613 03:19:28
don't forget endl 

shareefiiit:
20200603 08:32:02
Last edit: 20200603 08:47:05 

ashish_2495:
20200602 19:52:55
I am not understanding its input pattern can any one explain


bhavya_kala10:
20200523 18:47:38
Normal dfs


alexis_icy:
20200420 15:29:28
m getting a tle...used dfs..can anyone help? 

stranger480:
20200417 08:01:30
be careful while printing output "Case : " .A single space character costed me two WAs :(


mrmajumder:
20200327 05:31:39
Both BFS and DFS works! 

jopdhiwaala:
20200321 06:30:47
Dude i am so mad right now :( i thought that you dont have to traverse back and upwards _ 

killer_knight:
20191018 11:46:05
be careful of garbage values if you are using 1 based indexing..costed me 3 wa :(

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 