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':
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 ABE CFG BDH ABC 0 0 Sample Output: Case 1: 4
Wrong answer on submission, but correct on my local system.
output: "Case X" with a capital C!
We have to only consider the path starting with 'A'. I wasted time as didn't read it correctly.
Don't bother to thank me :)
Number of test cases are not given but at the end of all test cases it will give h = 0 and w = 0
It's Input Format is so confusing
F for me got wrong answer on 1 row 1 column for non A, wrong intialization
<p>AC in one shot!!!!!</p>
AC in one go :)
zoom AC in one go :)
|Added by:||Ali Arous|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|
|Resource:||FCIS Local Contest 2012|