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
akt_114: 2020-06-19 20:55:47

If you're getting TLE, use memoization :)

czhang2718: 2020-06-13 03:19:28

don't forget endl

shareefiiit: 2020-06-03 08:32:02

Last edit: 2020-06-03 08:47:05
ashish_2495: 2020-06-02 19:52:55

I am not understanding its input pattern can any one explain

bhavya_kala10: 2020-05-23 18:47:38

Normal dfs

alexis_icy: 2020-04-20 15:29:28

m getting a tle...used dfs..can anyone help?

stranger480: 2020-04-17 08:01:30

be careful while printing output "Case : " .A single space character costed me two WAs :(
its a simple dfs problem .

mrmajumder: 2020-03-27 05:31:39

Both BFS and DFS works!

jopdhiwaala: 2020-03-21 06:30:47

Dude i am so mad right now :( i thought that you dont have to traverse back and upwards -_-

killer_knight: 2019-10-18 11:46:05

be careful of garbage values if you are using 1 based indexing..costed me 3 wa :(

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