ABCPATH - ABC Path

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':

ABC

One such path is:

path

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
akshitforever: 2021-09-26 13:15:33

You have to start with A only and find max for that path only.

sravant_1727: 2021-05-01 14:06:24

What is the input format? I'm confused

caovanduy15: 2021-04-01 15:58:55

memorized recursive. AC. :3

wiseman_123: 2021-03-07 07:32:05

Be aware of the garbage values. Cost me 3WA... Sad life AF...

blueconch: 2021-02-12 03:54:04

AC in one go :)

amdee07: 2021-01-20 09:46:53

don't take maximum as global cost me 4WA's

princemishra: 2020-12-29 09:49:21

Last edit: 2021-06-21 12:30:06
rakibul6636: 2020-11-03 20:18:08

Can anyone please look at it, Why it's getting WA
<snip>

[NG]: Use the forum for code review and discussion.

Last edit: 2020-11-03 21:59:13
dhruvroy8: 2020-10-19 11:44:57

do i assume the the first character to be 'A'( i mean the [0][0]'th character ) or i will have to find it out by myself?

devendra777999: 2020-09-18 12:22:40

CAREFULL WITH EDGE CASES LIKE NO 'A' OR JUST 1 'A'....AND BFS WITH LITTLE MODIFICATION WORKS !!


Added by:Ali Arous
Date:2011-11-05
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS Local Contest 2012