Gold Mine Problem
Gold Mine Problem. Given a gold mine of n*m dimensions. Each field in this mine contains a positive integer which is the amount of gold in tons. Initially, the miner is in the first column but can be in any row. He can move only (right->,right up /,right down) that is from a given cell, the miner can move to the cell diagonally up towards the ...