Referência para 10189 (Luiza)

#include <stdio.h>
#include <algorithm>
using namespace std;

int n,m,_42=1;
char grid[110][110];
int mv[8][2] = {{1,0}, {1,1}, {1,-1},
        {0,1}, {0,-1},
        {-1,0}, {-1,1}, {-1,-1}};

int main() {
    while (1) {
        scanf("%d %d", &n,&m);
        if (!n && !m) break;
        if (_42>1) printf("\n");

        for (int i=0; i<n; i++)
            for (int j=0; j<m; j++)
                scanf(" %c", &grid[i][j]);

        for (int i=0; i<n; i++)
            for (int j=0; j<m; j++) {
                if (grid[i][j]=='*')
                    continue;

                int cnt=0;

                for (int k=0; k<8; k++) {
                    int nI=i+mv[k][0];
                    int nJ=j+mv[k][1];

                    if (nI<0 || nI>=n) continue;
                    if (nJ<0 || nJ>=m) continue;

                    if (grid[nI][nJ]=='*')
                        cnt++;
                }

                grid[i][j]=cnt+'0';
            }

        printf("Field #%d:\n", _42++);

        for (int i=0; i<n; i++) {
            for (int j=0; j<m ;j++)
                printf("%c", grid[i][j]);
            printf("\n");
        }
    }

    return 0;
}