UVA_10189_MineSweeper

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;
char table[100][100];char sol[100][100];

void update_sol(int i,int j,int r,int c){
 int nx,ny,cont;

 cont=0;
 /*procedo a revisar cada uno de los posibles lugares de minas*/
 if(table [i][j]!='*'){
    nx=i-1;ny=j+1;if(0<=nx && ny<c){if(table[nx][ny]=='*') cont++;}
    nx=i+1;ny=j+1;if(nx<r && ny<c){if(table[nx][ny]=='*') cont++;}
    nx=i;ny=j+1;if(ny<c){if(table[nx][ny]=='*') cont++;}
    nx=i;ny=j-1;if(0<=ny){if(table[nx][ny]=='*') cont++;}
    nx=i-1;ny=j;if(0<=nx){if(table[nx][ny]=='*') cont++;}
    nx=i+1;ny=j;if(nx<r){if(table[nx][ny]=='*') cont++;}
    nx=i-1;ny=j-1;if(0<=nx && 0<=ny){if(table[nx][ny]=='*') cont++;}
    nx=i+1;ny=j-1;if(0<=ny && nx<r){if(table[nx][ny]=='*') cont++;}
    sol[i][j]=cont+48;

 }else{
     sol [i][j]='*';
 }

}

int main() {
    int r,c,cont;

    cont=1;
    while(scanf("%d %d",&r,&c)){
        if(r==0 && c==0) break;
        if(1<cont) printf("\n");
        memset(table, '.', sizeof(table[0][0]) * r * c);
                getchar();
        for (int i=0;i<r;i++){
            for(int j=0;j<c;j++){
                scanf("%c",&table[i][j]);
            }
                        getchar();
        }
        for (int i=0;i<r;i++){
            for(int j=0;j<c;j++){
            update_sol(i,j,r,c);
            }
        }
        /*proceso de impresion*/
        printf("Field #%d:\n",cont);
         for(int i=0;i<r;i++){
            for(int j=0;j<c;j++){
                printf("%c",sol[i][j]);
            }
          printf("\n");
         }
         memset(sol, '.', sizeof(sol[0][0]) * r * c);
                 cont++;
    }
    return 0;
}