This is a problem that I solved earlier for the Programming Challenges book. Pretty simple problem.<\/p>\n
\r\nimport java.util.Scanner;\r\n\r\n\/**\r\n * \r\n * @author Sanchit M. Bhatnagar\r\n * @see http:\/\/uhunt.felix-halim.net\/id\/74004\r\n * \r\n *\/\r\npublic class P10189 {\r\n\r\n private static int[] arr = { -1, 0, 1 };\r\n\r\n public static void main(String[] args) {\r\n Scanner sc = new Scanner(System.in);\r\n int count = 1;\r\n while (sc.hasNextInt()) {\r\n int y = sc.nextInt();\r\n int x = sc.nextInt();\r\n if (x == 0 && y == 0)\r\n break;\r\n if (count != 1)\r\n System.out.println();\r\n char[][] field = new char[y + 2][x + 2];\r\n for (int i = 0; i < y; i++) {\r\n String t = sc.next();\r\n for (int j = 0; j < x; j++)\r\n field[i + 1][j + 1] = t.charAt(j);\r\n }\r\n\r\n for (int i = 0; i < y; i++) {\r\n for (int j = 0; j < x; j++) {\r\n int mines = 0;\r\n if (field[i + 1][j + 1] == '*')\r\n continue;\r\n if (field[i + 1][j + 1] == '.') {\r\n for (int zz = 0; zz < arr.length; zz++)\r\n for (int yy = 0; yy < arr.length; yy++)\r\n if (zz == 1 && yy == 1)\r\n continue;\r\n else if (field[i + 1 + arr[zz]][j + 1 + arr[yy]] == '*')\r\n mines++;\r\n\r\n String zxc = "" + mines;\r\n field[i + 1][j + 1] = (zxc.charAt(0));\r\n }\r\n\r\n }\r\n }\r\n\r\n System.out.println("Field #" + count + ":");\r\n for (int i = 0; i < y; i++) {\r\n for (int j = 0; j < x; j++) {\r\n if (j != x - 1)\r\n System.out.print(field[i + 1][j + 1]);\r\n else\r\n System.out.println(field[i + 1][j + 1]);\r\n }\r\n }\r\n count++;\r\n }\r\n sc.close();\r\n }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"This is a problem that I solved earlier for the Programming Challenges book. Pretty simple problem. import java.util.Scanner; \/** * * @author Sanchit M. Bhatnagar * @see http:\/\/uhunt.felix-halim.net\/id\/74004 * *\/ public class P10189 { private static int[] arr = { -1, 0, 1 }; public static void main(String[] args) { Scanner sc = new Scanner(System.in); … Continue reading UVA 10189 – Minesweeper<\/span>