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
abdelrahmanad: 2019-08-12 08:20:54

mohaimin66: thank u so much bro : )

aryan29: 2019-08-01 21:45:32

Seems like easy dfs to me at first but accepted after 3rte and 4wa

Last edit: 2019-08-01 23:40:58
sanket17: 2019-07-16 19:09:58

Don't forget to write Case costed me 2WA

andyy143: 2019-06-29 18:25:07

@shiv pratap singh
can you explain the approach this is what i tried and i am getting wrong ans

andyy143: 2019-06-29 18:17:05

will anyone explain me why this is giving wrong ans

shahayush457: 2019-06-18 15:47:30

Good problem to practice on dfs on 2D and a bit of dp required....

scolar_fuad: 2019-05-28 07:58:45

me_milan thank you so much without memorize got two time TLE >>

simple dfs+direction array+dp(memrization) happy coding

epsilon30: 2019-05-20 19:06:51

dont go back to A after Z caused me 2 WAs . :(

viru_31: 2019-04-18 22:10:08

please anyone can tell me that how to apply dfs in this problem

gs959_me: 2019-04-04 15:22:46

AC in one go

Last edit: 2019-04-04 15:57:12

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