提交记录 #293

编译情况：编译成功

固定测试点#1:

Wrong Answer

0.001s

496 kB

固定测试点#2:

Wrong Answer

0.001s

564 kB

附加测试点暂不可用

不可用

N/A

40【游戏】扫雷:如此传统的游戏，你现在就可以动手来开发

#include <stdio.h>

#define MAX_N 100
#define MAX_M 100

void processMap(int n, int m, char map[MAX_N][MAX_M], int result[MAX_N][MAX_M]) {
    int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
    int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (map[i][j] == '*') {
                for (int k = 0; k < 8; k++) {
                    int ni = i + dx[k];
                    int nj = j + dy[k];
                    if (ni >= 0 && ni < n && nj >= 0 && nj < m) {
                        result[ni][nj]++;
                    }
                }
            }
        }
    }
}

void printMap(int n, int m, char map[MAX_N][MAX_M], int result[MAX_N][MAX_M], int fieldNumber) {
    printf("Field #%d:\n", fieldNumber);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (map[i][j] == '*') {
                printf("*");
            } else {
                printf("%d", result[i][j]);
            }
        }
        printf("\n");
    }
}

int main() {
    int n, m;
    int fieldNumber = 0;

    while (scanf("%d %d", &n, &m) == 2) {
        if (n == 0 && m == 0) break;

        char map[MAX_N][MAX_M];
        int result[MAX_N][MAX_M] = {0};

        for (int i = 0; i < n; i++) {
            scanf("%s", map[i]);
        }

        processMap(n, m, map, result);
        fieldNumber++;
        printMap(n, m, map, result, fieldNumber);
        printf("\n");
    }

    return 0;
}