|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||4||4||3||100.000%|
Heino drew an H × W grid. Each cell was either empty or contained a mine. Indrek, a good friend of Heino, drew another H × W grid. In each cell of his grid, he wrote the total number of mines in the corresponding cell of Heino’s grid and all its adjacent cells (two cells are adjacent if they share a common point). Indrek then erased Heino’s grid. Given Indrek’s grid, your task is to help Heino restore his original grid.
You may assume that at least one solution always exists.
The first line of the input file contains two integers: H (1 ≤ H ≤ 600), the height of the grid, and W (1 ≤ W ≤ 600), the width of the grid. The following H lines each containing W digits describe Indrek’s grid.
The output file should contain H lines. Each of these lines should contain W characters: ‘
X’ for a mine and ‘
.’ for an empty cell.
If there are several correct solutions, submit any one of them.
3 5 24531 46631 34310
.XXX. .XX.. XX...
In this task you’re given 10 input files named minestest01.in, minestest02.in, minestest03.in, minestest04.in, minestest05.in, minestest06.in, minestest07.in, minestest08.in, minestest09.in, minestest10.in and as a solution you need to submit corresponding output files. You should not submit a program.