【蓝桥杯每日一练】——Minesweeper

Minesweeper

题目：

Minesweeper Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can’t remember. The goal of the game is to find where all the mines are located within a M x N field. The game shows a number in a square which tells you how many mines there are adjacent to that square. Each square has at most eight adjacent squares. The 4 x 4 field on the left contains two mines, each represented by a ``*’’ character. If we represent the same field by the hint numbers described above, we end up with the field on the right: … … .… … 100 2210 110 1110

翻译：

‎扫雷 你玩过扫雷吗？这个可爱的小游戏带有一个我们记不住名字的操作系统。游戏的目标是找到M x N字段中所有地雷的位置。游戏在一个正方形中显示一个数字，告诉你该正方形附近有多少个地雷。每个正方形最多有八个相邻的正方形。左侧的 4 x 4 字段包含两个地雷，每个地雷由一个""字符表示。如果我们用上面描述的提示数字表示相同的字段，我们最终会得到右侧的字段：… … .*… 100 2210 110 1110‎

输入：

The input will consist of an arbitrary number of fields. The first line of each field contains two integers n and m ( 0 < n, m$ \le$100) which stand for the number of lines and columns of the field, respectively. Each of the next n lines contains exactly m characters, representing the field. Safe squares are denoted by .’’ and mine squares by *,’’ both without the quotes. The first field line where n = m = 0 represents the end of input and should not be processed.

翻译：

‎输入将由任意数量的字段组成。每个字段的第一行包含两个整数 n 和 m（0 < n，m$ \le$100），它们分别代表字段的行数和列数。接下来的 n 行中的每一行都正好包含 m 个字符，表示字段。安全方块用".“表示，我的正方形用”*"表示，两者都没有引号。n = m = 0 的第一行表示输入的结束，不应进行处理。‎

输出：

For each field, print the message Field #x: on a line alone, where x stands for the number of the field starting from 1. The next n lines should contain the field with the ``.’’ characters replaced by the number of mines adjacent to that square. There must be an empty line between field outputs.

翻译：

‎对于每个字段，仅将消息 Field #x：打印在一行上，其中 x 代表从 1 开始的字段编号。接下来的 n 行应包含带有"."字符的字段，替换为与该正方形相邻的地雷数。字段输出之间必须有一个空行。‎

例子

输入：

4 4
…
…
.…
…
3 5
**…
…
.*…
0 0

输出：

Field #1:
100
2210
110
1110

Field #2:
**100
33200
1*100

解析：

使用n和m来控制行数和列数，当n和m都等于零时循环结束，==注意字符串的长度需要比m大一个地址来存放’\0’，==然后通过判断上下左右左上左下右上右下8个位置的字符是否为’*’，来决定数字的大小，特别地两个字段之间需要空一行。

代码：

#include<stdio.h>
int main()
{
    int n,m,i,j,num=1,s,p,q;
    while((scanf("%d%d",&n,&m))&&(n!=0&&m!=0))
    {
        char str[n][m+1];
        for(i=0;i<n;i++)
        {
            for(j=0;j<=m;j++)
            {
                scanf("%c",&str[i][j]);
            }
        }
        printf("Field #%d:\n",num);
        num++;
        for(i=0;i<n;i++)
        {
        	for(j=0;j<=m;j++)
        	{
        		s=0;
        		if(str[i][j]=='*')
                  printf("%c",str[i][j]);
                else if(str[i][j]=='.')
                {
                    for(p=-1;p<=1;p++)
                    {
                    	for(q=-1;q<=1;q++)
                    	{
                    		if(str[i+p][j+q]=='*')
                    		  s++;
						}
					}
					printf("%d",s);
                }
			}
			printf("\n");
		}
		printf("\n");
    }
	return 0;
}