这道题跟另外一道稍微简单的int型的扫雷一样一样的,先看另外一篇会更加容易理解,这题就是前一题的基础上稍微改动了下!
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
char a[105][105];
int main()
{
int n,m,flag = 0,t = 0;
while(cin>>n>>m)
{
if(n == 0 && m == 0)
break;
memset(a, 0, sizeof(a));
if(flag == 1)
cout<<endl;
flag = 1;
for(int i = 1;i <= n;i++)
{
for(int j =1;j <= m;j++)
{
cin>>a[i][j];
}
}
for(int i = 1;i <= n;i++)
{
for(int j =1;j <= m;j++)
{
if(a[i][j] != '*')
{
a[i][j] = '0';
for(int p = i -1 ;p <= i + 1;p++)
{
for(int q = j -1; q <= j + 1;q++)
{
if(a[p][q] == '*')
a[i][j] ++;//统计不是炸弹的格子周围的炸弹数
}
}
}
}
}
t++;
cout<<"Field #"<<t<<":"<<endl;
for(int i = 1;i <= n;i++)
{
for(int j =1;j <= m;j++)
{
if(a[i][j] == '*')
cout<<a[i][j];
else
cout<<a[i][j];
}
cout<<endl;
}
}
return 0;
}