提交记录 #211

编译情况：编译成功

固定测试点#1:

Accepted

0.001s

228 kB

固定测试点#2:

Accepted

0.001s

232 kB

额外测试点#500:

Accepted

0.003s

556 kB

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

#include<stdio.h>  
int main(void)  
{  
    int n, m, i, j, cnt = 0;  
    char map[1000][1000] = {0};  
    scanf("%d %d", &n, &m);  
    while (n != 0 || m != 0)  
    {  
        cnt++;  
        if(cnt != 1)printf("\n");  
        for (i = 1; i <= n; i++)  
        {  
            while (getchar() != '\n')//清空缓冲区的\n  
                continue;  
            for (j = 1; j <= m; j++)  
            {  
                scanf("%c", &map[i][j]);  
            }  
        }  
  
        printf("Field #%d:\n", cnt);  
        for (i = 1; i <= n; i++)  
        {  
            for (j = 1; j <= m; j++)  
            {  
                if (map[i][j] == '.')//.转换为0  
                    map[i][j] = '0';  
            }  
        }  
  
        for (i = 1; i <= n; i++)  
        {  
            for (j = 1; j <= m; j++)  
            {  
                if (map[i][j] == '*')//*周围八个数++（要注意周围是*的情况不变）  
                {  
                    if(map[i - 1][j - 1]  != '*')map[i - 1][j - 1]++;  
                    if (map[i - 1][j] != '*')map[i - 1][j]++;  
                    if (map[i - 1][j + 1] != '*')map[i - 1][j + 1]++;  
                    if (map[i][j - 1] != '*')map[i][j - 1]++;  
                    if (map[i][j + 1] != '*')map[i][j + 1]++;  
                    if (map[i + 1][j - 1] != '*')map[i + 1][j - 1]++;  
                    if (map[i + 1][j] != '*')map[i + 1][j]++;  
                    if (map[i + 1][j + 1] != '*')map[i + 1][j + 1]++;  
                }  
            }  
        }  
  
        for (i = 1; i <= n; i++)  
        {  
            for (j = 1; j <= m; j++)  
            {  
                printf("%c", map[i][j]);  
            }  
            printf("\n");  
        }  
      
        scanf("%d %d", &n, &m);  
    }  
  
    return 0;  
}