I - Mine Sweeper

亦凉 2022-03-20 08:08 180阅读 0赞

### 题目描述： ###

The game Minesweeper is played on an n by n grid. In this grid are hidden m mines, each at a distinct grid location. The player repeatedly touches grid positions. If a position with a mine is touched, the mine explodes and the player loses. If a positon not containing a mine is touched, an integer between 0 and 8 appears denoting the number of adjacent or diagonally adjacent grid positions that contain a mine. A sequence of moves in a partially played game is illustrated below.  
![在这里插入图片描述][b07bf2827b3fe33f354a9797b2400bf8_v_1548893686]  
Here, n is 8, m is 10, blank squares represent the integer 0, raised squares represent unplayed positions, and the figures resembling asterisks represent mines. The leftmost image represents the partially played game. From the first image to the second, the player has played two moves, each time choosing a safe grid position. From the second image to the third, the player is not so lucky; he chooses a position with a mine and therefore loses. The player wins if he continues to make safe moves until only m unplayed positions remain; these must necessarily contain the mines.

Your job is to read the information for a partially played game and to print the corresponding board.  
Input  
The first line of input contains a single postitive integer n <= 10. The next n lines represent the positions of the mines. Each line represents the contents of a row using n characters: a period indicates an unmined positon while an asterisk indicates a mined position. The next n lines are each n characters long: touched positions are denoted by an x, and untouched positions by a period. The sample input corresponds to the middle figure above.  
Output  
Your output should represent the board, with each position filled in appropriately. Positions that have been touched and do not contain a mine should contain an integer between 0 and 8. If a mine has been touched, all positions with a mine should contain an asterisk. All other positions should contain a period.  
Sample Input  
8  
…**…\*  
…*.  
…*…  
…  
…  
…\*…  
…**.*.  
…*…  
xxx…  
xxxx…  
xxxx…  
xxxxx…  
xxxxx…  
xxxxx…  
xxx…  
xxxxx…  
Sample Output  
001…  
0013…  
0001…  
00011…  
00001…  
00123…  
001…  
00123…  
题意：这个就是一个模拟扫雷游戏的题吧。  
样例给出了一个8行的地图。还有8行的输出格式。  
输出时按照输出格式输出，将x的地方换成数字。  
如果x的地方是雷，那么将全部的雷都要显示出来（即：模拟第三张图）。  
分析：遍历输出格式，如果是X，则一个dfs看周围有多少个雷并将数字替换X。如果X的地方就是一个雷， 那么flaf标记一下，在之后区别处理。

#include"stdio.h"
    #include"string.h"
    char Map[11][11];
    char bok[11][11];
    int n,k,flaf;
    void dfs(int X,int Y)
    {
        int x[8]={-1,-1,-1,0,0,1,1,1};
        int y[8]={-1,0,1,-1,1,-1,0,1};
        int cont=0;
        for(int i=0;i<8;i++)
        {
            int a=X+x[i];
            int b=Y+y[i];
            if(a>=0&&a<n&&b>=0&&b<k&&Map[a][b]=='*')
            {
                  cont++;
            }
        }
        bok[X][Y]=cont+'0';
        if(Map[X][Y]=='*')
          {
              flaf=1;
          }
    }
    int main()
    {
        while(~scanf("%d",&n))
        {
            k=n;flaf=0;
            for(int i=0;i<n;i++)
            {
                scanf("%s",Map[i]);
            }
            for(int i=0;i<n;i++)
            {
                scanf("%s",bok[i]);
            }
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<n;j++)
                {
                    if(bok[i][j]=='x')
                    {
                        dfs(i,j);
                    }
                }
            }
            if(flaf==1)
            {
                for(int i=0;i<n;i++)
                    for(int j=0;j<n;j++)
                    {
                        if(Map[i][j]=='*')
                            bok[i][j]='*';
                    }
            }
            for(int i=0;i<n;i++)
                printf("%s\n",bok[i]);
        }
    }```

[b07bf2827b3fe33f354a9797b2400bf8_v_1548893686]: https://vj.e949.cn/b07bf2827b3fe33f354a9797b2400bf8?v=1548893686