提交记录 #300

#include <stdio.h>

int jisuan(int a, int b, char map[1003][1003]) {
    int result = 0;
    if (map[a - 1][b - 1] == '*') result++;
    if (map[a][b - 1] == '*') result++;
    if (map[a + 1][b - 1] == '*') result++;
    if (map[a - 1][b] == '*') result++;
    if (map[a + 1][b] == '*') result++;
    if (map[a - 1][b + 1] == '*') result++;
    if (map[a][b + 1] == '*') result++;
    if (map[a + 1][b + 1] == '*') result++;
    return result;
}

int main() {
    int number1, number2;
    int line = 1;
    while (1) {
        scanf("%d%d", &number1, &number2);
        if (number1 == 0 && number2 == 0)
        {
            getchar();
            break;
        }
        char map[1003][1003];
        for (int i = 0; i < number1 + 2; i++)
        {
            map[i][0] = '.';
            map[0][i] = '.';
        }
        for (int i = 0; i < number2 + 2; i++)
        {
            map[i][0] = '.';
            map[0][i] = '.';
        }
        for (int i = 1; i < number1 + 1; i++) {
            for (int q = 1; q < number2 + 1; q++) {
                scanf(" %c", &map[i][q]);
            }
        } if (line > 1)
        {
          printf("\n");
        }
           
        printf("Field #%d:\n", line++);
        for (int i = 1; i < number1 + 1; i++) {
            for (int q = 1; q < number2 + 1; q++) {
                if (map[i][q] == '*') {
                    printf("*");
                }
                else {
                    printf("%d", jisuan(i, q, map));
                }
              
            }  printf("\n");
           
        }
       
    }
    return 0;
}