digger. For vour task, you have been given a `map' of all the underground resources in the mine. This ma comes as a file. The file has n rows. Each row has n space-separated integers, Each integer is open-air program

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 6PE
icon
Related questions
Question

Java language

• Write a program that reads as a command-line argument a number n, this number is the
number of columns and rows mentioned above.
• It then reads from standard input n * n integers, each integer being between zero (0) and one
hundred (100), and then writes to standard out a single integer representing the maximum
possible profit
Transcribed Image Text:• Write a program that reads as a command-line argument a number n, this number is the number of columns and rows mentioned above. • It then reads from standard input n * n integers, each integer being between zero (0) and one hundred (100), and then writes to standard out a single integer representing the maximum possible profit
You have been hired at an open-air mine. You are to write a program to control a digger. For
your task, you have been given a `map' of all the underground resources in the mine. This map
comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is
between zero and one hundred (inclusive). The file should be understood to represent a grid, n
wide by n deep. Each square in the grid can contain valuable resources. The value of these
resources can go from zero (no resources) to 100 (max resources).
The grid maps the resources just below the surface, and down to the lowest diggable depths.
The digger starts at the surface (so, just on top of the topmost row in the grid)-at any
horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig
diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the
first row of the grid. In its second time-step, it'll hit the second row, and so on. When the digger
reaches row number n, it has to be air-lifted out of the mine, and is no longer usable.
Transcribed Image Text:You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a `map' of all the underground resources in the mine. This map comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is between zero and one hundred (inclusive). The file should be understood to represent a grid, n wide by n deep. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)-at any horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit the second row, and so on. When the digger reaches row number n, it has to be air-lifted out of the mine, and is no longer usable.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Introduction to computer system
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning