Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can't remember. The goal of the game is to find where all the mines are located within a M x N field.
The input will consist in a couple of integers n and m (0 < n, m <= 100) which stand for the number of lines and columns of the field, respectively. Followed by a matrix which contains exactly the characters representing the field.
A matrix replacing all the "." characters by the number of mines adjacent to that square.
This problem appeared originally in programming-challenges.com
The text was updated successfully, but these errors were encountered: