Matematické Fórum

#include <cstdio>
#include <queue>

#define FOR(i,n) for (int i = 0; i < n; i++)
#define FORTO(i,n,m) for (int i = n; i <= m; i++)

using namespace std;

#define MAX_FIELD 100

struct mine
{
    int p1, p2; // position of the mine
    mine (int x, int y) { p1 = x; p2 = y; }
};

int field[MAX_FIELD][MAX_FIELD]; // field of mines
int n,m; // size of the current field

void mark_adjust(int p1, int p2)
{
    // pricita 1 na kazde policko okolo miny
    FORTO(i,-1,1)
        FORTO(j,-1,1) {
            int newp1 = p1 + i, newp2 = p2 + j;
            if (0 <= newp1 && newp1 <= n &&
                0 <= newp2 && newp2 <= m)
                if (field[newp1][newp2] != -1)
                    field[newp1][newp2]++;
        }
}

int main()
{
    queue<mine> que;
    int x = 0;
    scanf("%d%d",&n,&m);
    while (n && m) {
        x++;
        char c = getchar(); // nacitanie '\n'
        // input
        FOR(i,n) {
            FOR(j,m) {
                c = getchar();
                if (c == '*') {
                    field[i][j] = -1;
                    mine M(i,j);
                    que.push(M);
                } else
                    field[i][j] = 0;
            }
            c = getchar(); // nacitanie '\n'
        }
        // computation
        while (!que.empty()) {
            mine M = que.front();
            mark_adjust(M.p1,M.p2);
            que.pop();
        }
        // output
        printf("Field #%d:\n",x);
        FOR(i,n) {
            FOR(j,m) {
                if (field[i][j] == -1)
                    printf("*");
                else
                    printf("%d",field[i][j]);
            }
            printf("\n");
        }
        printf("\n");
        scanf("%d%d",&n,&m);
    }
    return 0;
}