http://snippets.dzone.com/posts Sun, 12 Oct 2008 18:51:26 GMT DZone Snippets: minesweeper code http://snippets.dzone.com/posts/show/5205 A solution for the Minesweeper problem. <br /> <br />Problem description: <br /><a href="http://icpcres.ecs.baylor.edu/onlinejudge/external/101/10189.html">http://icpcres.ecs.baylor.edu/onlinejudge/external/101/10189.html</a> <br /> <br />Author: <a href="http://joanatrindade.wikidot.com">Joana Matos Fonseca da Trindade</a> <br />Date: 2008.03.08 <br /> <br /><code> <br />/* <br /> * A solution for the Minesweeper problem. <br /> * UVa ID: 10189 <br /> */ <br />#include <stdio.h> <br /> <br />#define MINE '*' <br />#define MATRIX_OFFSET 1 <br /> <br />int main (int argc, const char * argv[]) { <br /> /* number of lines of the mine field */ <br /> long n; <br /> <br /> /* number of colums of the mine field */ <br /> long m; <br /> <br /> /* iterators for retrieving the content of each field line*/ <br /> long i, j; <br /> <br /> /* field number identifier */ <br /> long fieldNumber = 0; <br /> <br /> while(scanf("%ld %ld", &n, &m) != EOF) { <br /> <br /> /* 0 0, ends the program */ <br /> if (!n && !m) { <br /> return 0; <br /> } else { <br /> if (fieldNumber > 0) { <br /> /* <br /> * workaround for the extra line on the output, <br /> * which was giving me a Wrong Answer verdict.. <br /> * so only insert an extra line if there's more <br /> * to come :-) <br /> */ <br /> printf("\n"); <br /> } <br /> } <br /> <br /> /* increment field id */ <br /> fieldNumber++; <br /> <br /> /* a bidimensional array representing the input mine field */ <br /> char inputField[n + MATRIX_OFFSET + 1][m + MATRIX_OFFSET + 1]; <br /> <br /> /* a bidimensional array to output the mine field */ <br /> int outputField[n + MATRIX_OFFSET + 1][m + MATRIX_OFFSET + 1]; <br /> <br /> /* temporary variable to retrieve mine field lines */ <br /> char line[m]; <br /> <br /> /* init, O(n2) */ <br /> for (i = 0; i < n + MATRIX_OFFSET + 1; i++) { <br /> for (j = 0; j < m + MATRIX_OFFSET + 1; j++) { <br /> outputField[i][j] = 0; <br /> } <br /> } <br /> <br /> /* read mine field, O(n2) */ <br /> for (i = 0; i < n; i++) { <br /> scanf("%s\n",line); <br /> for (j = MATRIX_OFFSET; j < m + MATRIX_OFFSET; j++) { <br /> inputField[i + MATRIX_OFFSET][j] = line[j - MATRIX_OFFSET]; <br /> } <br /> } <br /> <br /> /* update output, O(n2) */ <br /> for (i = MATRIX_OFFSET; i < n + MATRIX_OFFSET; i++) { <br /> for (j = MATRIX_OFFSET; j < m + MATRIX_OFFSET; j++) { <br /> if (inputField[i][j] == MINE) { <br /> <br /> /* upper neighbours */ <br /> outputField[i-1][j-1]++; <br /> outputField[i-1][j]++; <br /> outputField[i-1][j+1]++; <br /> <br /> /* same level neighbours */ <br /> outputField[i][j-1]++; <br /> outputField[i][j+1]++; <br /> <br /> /* lower neighbours */ <br /> outputField[i+1][j-1]++; <br /> outputField[i+1][j]++; <br /> outputField[i+1][j+1]++; <br /> } <br /> } <br /> } <br /> <br /> /* present output, O(n2) */ <br /> printf("Field #%ld:\n",fieldNumber); <br /> for (i = MATRIX_OFFSET; i < n + MATRIX_OFFSET; i++) { <br /> for (j = MATRIX_OFFSET; j < m + MATRIX_OFFSET; j++) { <br /> if (inputField[i][j] == MINE) <br /> printf("%c", MINE); <br /> else <br /> printf("%d",outputField[i][j]); <br /> } <br /> printf("\n"); <br /> } <br /> <br /> } <br /> <br /> return 0; <br />} <br /></code> Sat, 08 Mar 2008 18:30:03 GMT http://snippets.dzone.com/posts/show/5205 jmftrindade (Joana M. F. da Trindade)