You have a maze with obstacles and non-zero digits in it: 9+ 7 8 + 4 1 2 3 4 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 the four neighbouring squares (up, down, left, right) and you cannot walk into obstacles or walk into a square more than once. When you finish, you can get a number by writing down the digits you encounter in the same order as you meet them. For example, you can get numbers 9784, 4832145, etc. The biggest number you can get is 791452384, shown in the picture above. Your task is to find the biggest number you can get. Input There will be at most 25 test cases. Each test begins with two integers R and C (2 < R,C < 15, R C< 30), the number of rows and columns of the maze. The next R rows represent the maze. Each line contains exactly C characters (without leading or trailing spaces), each of them will be either # 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 with R C-0, you should not process it. Output For each test case, print the biggest number you can find, on a single line. Sample Input 37 ##9784# ##123## ##45### 0 0 Sample Output 791452384 N LO
You have a maze with obstacles and non-zero digits in it: 9+ 7 8 + 4 1 2 3 4 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 the four neighbouring squares (up, down, left, right) and you cannot walk into obstacles or walk into a square more than once. When you finish, you can get a number by writing down the digits you encounter in the same order as you meet them. For example, you can get numbers 9784, 4832145, etc. The biggest number you can get is 791452384, shown in the picture above. Your task is to find the biggest number you can get. Input There will be at most 25 test cases. Each test begins with two integers R and C (2 < R,C < 15, R C< 30), the number of rows and columns of the maze. The next R rows represent the maze. Each line contains exactly C characters (without leading or trailing spaces), each of them will be either # 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 with R C-0, you should not process it. Output For each test case, print the biggest number you can find, on a single line. Sample Input 37 ##9784# ##123## ##45### 0 0 Sample Output 791452384 N LO
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
Max Function
Statistical function is of many categories. One of them is a MAX function. The MAX function returns the largest value from the list of arguments passed to it. MAX function always ignores the empty cells when performing the calculation.
Power Function
A power function is a type of single-term function. Its definition states that it is a variable containing a base value raised to a constant value acting as an exponent. This variable may also have a coefficient. For instance, the area of a circle can be given as:
Question
Transcribed Image Text:You have a maze with obstacles and non-zero digits in it:
9+ 7
8 + 4
1
2
3
4
5
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 the four neighbouring squares (up, down, left, right) and you cannot
walk into obstacles or walk into a square more than once. When you finish, you can get a number by
writing down the digits you encounter in the same order as you meet them. For example, you can get
numbers 9784, 4832145, etc. The biggest number you can get is 791452384, shown in the picture above.
Your task is to find the biggest mumber you can get.
Input
There will be at most 25 test cases. Each test begins with two integers R and C (2 < R,C < 15,
R+C < 30), the number of rows and columns of the maze. The next R rows represent the maze. Each
line contains exactly C characters (without leading or trailing spaces), each of them will be either #
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 with R = C = 0, you should
not process it.
Output
For each test case, print the biggest number you can find, on a single line.
Sample Input
37
##9784#
##123##
##45###
0 0
Sample Output
791452384
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education