1333: Biggest Number
时间限制: 1Sec 内存限制:128 MB提交:98 解决:6
[ 状态] [ 讨论版] [ 提交] [命题人: ]
题目描述
You have a mazewithobstacles andnon-zero digitsin it:
You can start from any square, walk in the maze, and finally stop at some square.Each step, you may only walk into one of thefour neighbouring squares (up, down, left, right)and you cannot walk into obstaclesorwalk intoa square more than once. When you finish, you can get a number by writing down the digits you encounter in the same order as youmeetthem.For example, you can get numbers 9784, 4832145 etc. The biggest number you can get is 791452384, shownin the pictureabove.
Your task is to find the biggest number you can get.
输入
There will be at most 25 test cases. Each test begins with two integersRandC(2<=R,C<=15,R*C<=30), the number of rows and columns of the maze. The nextRrows represent the maze. Each line contains exactlyCcharacters (without leading or trailing spaces), each of them will be either '//m.mmm2012.com/acm/#' or one of the nine non-zero digits. There will be at least one non-obstacle squares (i.e. squares with a non-zero digit in it) in the maze. The input is terminated by a test case withR=C=0, you should not process it.
输出
For each test case, print thebiggestnumber you can find, on a single line.
样例输入
Copy
3 7 ##9784# ##123## ##45### 0 0
样例输出
Copy
791452384
来源/分类