Minesweeper

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

For each squares without mine (shown by '.'), tell the number of mines (shown by '*') in adjacent squares. The test cases always have 16x16 squares and 40 mines.

This problem is set by leonid & shinh to enjoy a "speed golfing" event. We are planning to solve this problem within 2 hours in Ruby. We'll use (2hrs) suffixes (e.g., "shinh (2hrs)") as our name during the mini event. Please join us with the (2hrs) suffix if you have time. Of course, solutions with other languages will be welcomed, although I'm not sure if there are other competitors.

We'll finish this speed golfing at 9pm in PDT. After this time, this problem bec
omes a usual 2 week problem. Please check this link for the deadline of the speed golfing in your timezone: http://www.timeanddate.com/worldclock/fixedtime.html?&day=30&month=07&year=2012&hour=21&min=00&sec=0&p1=224

This problem is inspired by a problem in Perl Golf history book (http://terje2.frox25.no-ip.org/). The solutions in this book may not work for this problem due to size difference, but you may be able to use them as a big hint.

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

.....***..*.....
...*.*....**....
..*...........*.
..*......*...*..
....*.**.......*
................
.......*..*.....
.*....*........*
.....*..**......
.......*.*......
.....*...*......
.....*..........
.......*........
.....**.*.......
.....*.*..*..*..
.....*.*........

Sample output:

00113***12*31000
012*3*4212**1111
02*32110123222*1
02*312222*101*32
0112*2**2110112*
0001123321110011
1110012*11*10011
1*1012*33321001*
11101*33**200011
0000223*5*300000
00002*313*200000
00002*3121100000
0000234*21000000
00002**4*2111110
00003*6*32*11*10
00002*4*21111110

Sample input:_

.*.*.*........*.
**.***........**
*...............
.........*......
................
................
..............**
..............*.
............*.**
...............*
**........*.....
.*...*..........
**..............
................
**......***...**
.**.....*.*..**.

Sample output:

3*4*5*20000002*3
**4***20000002**
*322321011100122
110000001*100000
0000000011100000
0000000000000122
00000000000002**
00000000000114*5
000000000001*3**
221000000112123*
**20111001*10011
5*301*1001110000
**20111000000000
4420000123210122
**310002***213**
3**10002*5*21**3

Sample input:_

*..*.*...*.....*
..............*.
*.........*.....
....*....*...*..
...........***..
.*.........*.*..
............****
............*.*.
............***.
................
..........*.*...
.....*..........
*.....*.........
......**....*...
.........**.....
*.*..........*.*

Sample output:

*11*2*101*10012*
22112110122101*2
*101110012*11221
1101*1001*334*20
11111100113***30
1*100000002*7*52
111000000013****
000000000003*8*4
000000000002***2
0000000001133421
0000111001*2*100
11001*2101121100
*10013*310011100
110002**2222*100
121101222**22221
*2*1000012211*2*

Ranking

Ruby _

Perl _

Python _

Arc _

JavaScript _

Lua _

J _

K _

C _

Haskell _

sed _

GolfScript _

Vim _

Language Ranking_

return to the top page