解题思路:
题目大意是说找‘.’ 的周围有多少个‘*’这个周围是八个方向。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace  std;
static const int MAX=101;
int n,m;
int main(){
int i,j,c=1;
while(cin>>n>>m&&n&&m){
//添加外圈
int b[MAX][MAX]={0};
char a[n+2][m+2];
memset(a,'.',sizeof(a));
    //输入
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(a[i][j]=='.'){
if(a[i-1][j-1]=='*')  b[i][j]++;
if(a[i-1][j]=='*')    b[i][j]++;
if(a[i-1][j+1]=='*')  b[i][j]++;
if(a[i+1][j-1]=='*')  b[i][j]++;
if(a[i+1][j]=='*')    b[i][j]++;
if(a[i+1][j+1]=='*')  b[i][j]++; 
if(a[i][j-1]=='*')    b[i][j]++;
if(a[i][j+1]=='*')    b[i][j]++;
a[i][j]=b[i][j]+'0';
 }
          else continue;
  }
}
cout<<"Field #"<<c<<":"<<endl;
    for(i=1;i<=n;i++){
    for(j=1;j<=m;j++){
    cout<<a[i][j];
    }
    cout<<endl;
    }
    c++;
    cout<<endl;
}
}