ABCPATH - ABC Path

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

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

hide comments
2024-08-02 22:55:30
keep grinding and still you wont get it....
2024-03-24 11:35:26
Learning dfs , A/C after few try, Peace ..
2024-03-06 13:55:24
<snip>
it giving wrong answer
please help
[Simes]: read the footer, don't post code here. Use the forum.

Last edit: 2024-03-06 19:35:01
2023-06-23 14:33:17
so basically, here input format is like you have to write your code in infinite loop and when two inputs 0 0 appear,
then you have to break that loop.

=>spoilers: <snip>
[Simes]: Let people experience the joy of figuring it out for themselves.

Last edit: 2023-06-25 19:49:57
2023-03-01 08:36:21
Wrong answer on submission, but correct on my local system.
Please check out.
<snip>
[Simes]: Read the footer - Don't post source code here, use the forum.
Okay


Last edit: 2023-03-01 09:24:33
2023-01-29 10:59:11
output: "Case X" with a capital C!
2022-09-03 04:08:33
We have to only consider the path starting with 'A'. I wasted time as didn't read it correctly.
2022-07-10 13:35:39
Don't bother to thank me :)
<snip>
[Simes]: We won't.

Last edit: 2022-07-10 18:56:18
2022-06-20 18:36:00
Number of test cases are not given but at the end of all test cases it will give h = 0 and w = 0
int tc = 1;
while(true){
int w, h;
cin >> w >> h;
if(w == 0 && h == 0){
break;
}
// code here
}

Last edit: 2022-06-20 18:36:33
2022-05-17 00:00:33
It's Input Format is so confusing
Can someone plz explain the input format
why is 0 0 given in the last
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.