18 人解决，25 人已尝试。
20 份提交通过，共有 69 份提交。
5.2 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
In order to catch Alex and Kid, the police have set up a mine area around the house where Alex and Kid live. Fortunately, Kid has got a friend in the police, so he got a map to describe where the mines are. This map is given like the famous game―mines, that is, in n*n grids given, each grid has got a number to describe how many mines are around. Unfortunately, this map has got some errors. Now, give you the map and real mine position, please output the error position.
In first line, the number of lines l and the number of columns c are given. (1<=l, c<=16)
After that, the map is described like this:
0 1 2 3 0 1 2 3
1 2 3 4 4 3 2 1
0 1 2 3 2 5 3 6
And the mine area like this(X–mine O―no mine)
XOOOOXXX
OOXXOXOX
XXXXXXXX
You should give the line and column number (begin with 0) of the error position like following:
(3,4)
You should output one error position per line. In order from up to down, each line from left to right.
X C0 C1 C2
L1
L2
L3
If no error found, just output “All right!” in a line.
16 16 1334333423122332 3645364735142644 1446341414142633 2233442212245543 3443334321114573 3545554423245553 4755365844233554 3656342332324452 2233443232436453 3443334331214573 1335554434345553 3645364735142644 1446341725242633 2233442212334443 2333212132303352 8202222020212222 XXXOOXXXXOOOOXXX OOXXXOXOXOXOXOXO XOXOXOXOXOXOXOXO OXOXOOOOOOOOOXXO OOOOXXOOOOOXXXOX XXXOOXXXXOOOOXXX XXXXXOXOXOXOXOXO XOXOXOXXOXOXOXOX OXOXOOOOOOOOOXXO OOOOXXOOOXOXXXOX XXXOOXXXXOOOOXXX OOXXXOXOXOXOXOXO XOXOXOXOXOXOXOXO OXOXOOOOOXOOOXXO OOOOXXOOOOOXOXOX XOXOOOOXOXOOOOXO
(6,7) (12,7) (13,8) (15,0)
18 人解决，25 人已尝试。
20 份提交通过，共有 69 份提交。
5.2 EMB 奖励。