Mine Sweeper

描述：

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.

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.

输入：

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

输出：

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.

样例输入：

8
...**..*
......*.
....*...
........
........
.....*..
...**.*.
.....*..
xxx.....
xxxx....
xxxx....
xxxxx...
xxxxx...
xxxxx...
xxx.....
xxxxx...

样例输出：

001.....
0013....
0001....
00011...
00001...
00123...
001.....
00123...

题目大意：

输入一个正整数n接下去n行是n*n的地图*表示地雷位置，接下去n行n列为地图的位置如果为x表示为探索过的位置。如果探索过的位置为*则输出地图中所有雷的位置，如果为.输出周围的雷的数量。

代码如下：

#include<stdio.h>
int n;
char map[15][15],map1[15][15];
int find(int a,int b)                       //搜索map[a][b]周围的地雷数量
{int e=0;for(int x=-1;x<=1;x++){for(int y=-1;y<=1;y++){if(x==0&&y==0)continue;else{if(x+a>=0&&x+a<n&&y+b>=0&&y+b<n&&map[x+a][y+b]=='*')e++;}}}return e;
}
void print()
{for(int i=0;i<n;i++){for(int j=0;j<n;j++){printf("%c",map1[i][j]);}printf("\n");}
}
void sove()                                 //打印所有雷的位置
{for(int i=0;i<n;i++){for(int j=0;j<n;j++){if(map[i][j]=='*'){map1[i][j]='*';}}}
}
int main()
{scanf("%d",&n);for(int i=0;i<n;i++){scanf("%s",map[i]);}for(int i=0;i<n;i++){scanf("%s",map1[i]);}   for(int i=0;i<n;i++){for(int j=0;j<n;j++){if(map1[i][j]=='x'&&map[i][j]!='*'){int count=find(i,j);map1[i][j]=count+'0';}if(map1[i][j]=='x'&&map[i][j]=='*')              {sove();}          }}print();return 0;
}

Mine Sweeper相关推荐

Mine Sweeper II
Mine Sweeper II 题意: 给你两个大小为 n * m 的扫雷图 A, B,要求通过最多 n * m/2 次转换(转换指把一个不是雷的格子变成雷, 或者把一个是雷的格子变成空白格),使得 ...
构造 - Mine Sweeper II - ICPC 2020 上海
构造 - Mine Sweeper II - ICPC 2020 上海题意: 给定两个 n × m 的由 ′ X ′ 和 ′ . ′ 矩阵 A 和 B , 表示两个扫雷的矩 ...
2020 icpc上海站 Mine Sweeper II
Mine Sweeper II 题意给你两个用"."和X组成的矩阵,X表示地雷,每个"."周围八个格子有几个雷贡献就是多少,改变第二个字符矩阵,使最后两个矩阵 ...
gym 102900 Mine Sweeper II
gym 102900 Mine Sweeper II 题目链接题意给定两个 n × m n\times m n×m的扫雷地图 A , B A,B A,B,所有非地雷格子都有一个数字,表示这个格子周 ...
POJ 2612 Mine Sweeper 扫雷游戏
原题 http://poj.org/problem?id=2612 题目: Mine Sweeper Time Limit: 1000MS Memory Limit: 65536K Total Sub ...
上海ICPC Mine Sweeper II
上海ICPC Mine Sweeper II 题意:给定扫雷图 A A A和 B B B,它们的大小为 n × m n\times m n×m,设 A A A中所有空白格的贡献为 s u m sum ...
[C语言]扫雷游戏(Mine Sweeper)
目录扫雷游戏:: game.h game.c 1.打印菜单 2.初始化雷区 3.打印雷区 4.布置雷 5.排查雷 6.统计排查坐标周围雷的个数 test.c 扫雷游戏:: game.h #pragm ...
2020ICPC上海 B Mine Sweeper II（思维）
链接题目描述 A mine-sweeper map X {X} X can be expressed as an n × m n\times m n×m grid. Each cell of the ...
搜索04 Mine Sweeper
题目链接 Description The game Minesweeper is played on an n by n grid. In this grid are hidden m mines, ...

Mine Sweeper

Mine Sweeper相关推荐

最新文章

热门文章