http://www.programmersheaven.com/ Contains the latest posts from the thread 'Mines-problem! Please help!' posted on the 'Pascal' forum at Programmer's Heaven. en Copyright 2013 Programmers Heaven Wed, 19 Jun 2013 10:58:47 -0700 Wed, 19 Jun 2013 10:58:47 -0700 Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic http://www.rssboard.org/rss-specification 360 http://www.programmersheaven.com/images/ph.gif http://www.programmersheaven.com/ 88 31 http://www.programmersheaven.com/mb/pasprog/428633/428633/mines-problem-please-help/ Hi! I need help about this task:<br /> Before entering the minefield, you are given a matrix 'b' filled with integers where every b[i,j] of them stands for a number of mines around (not includig) the a[i,j] part of the minefield.<br /> The matrix' are NxN where N is a given integer N&gt;=5.<br /> The task is to write matrix 'a' that represents the minefield (if there is a mine then '*' else 's') so you could cross the minefield safely.<br /> <br /> example<br /> Input:<br /> 5<br /> 2 3 4 3 1<br /> 3 4 5 4 3<br /> 1 3 5 4 3<br /> 1 1 2 2 3<br /> 0 0 1 1 1<br /> <br /> Output:<br /> s * * s s <br /> s * * * s<br /> * s s * *<br /> s s s * s <br /> <br /> I've been trying to solve it for days but I can't!<br /> Please help!<br /> Please use only pascal.<br /> Thanks!!! http://www.programmersheaven.com/mb/pasprog/428633/428633/mines-problem-please-help/ Wed, 30 May 2012 15:19:08 -0700 Pascal