以下是来自名著《信息学奥赛课课通（C++）》P186~187的代码，标准版，AC到手 #include<iostream> #include<cstdio> using namespace std; int dx[8]={-1,-1,0,1,1,1,0,-1}; int dy[8]={0,1,1,1,0,-1,-1,-1}; int main(){ char mine[101][101]; int sum[101][101]={0}; int n,m,i,j,ni,nj,k,ans=0; scanf("%d %d\n",&n,&m); for(i=0;i<n;i++){ for(j=0;j<m;j++)mine[i][j]=getchar(); getchar(); } for(i=0;i<n;i++) for(j=0;j<m;j++) if(mine[i][j]'?') for(k=0;k<8;k++){ ni=i+dx[k]; nj=j+dy[k]; if(ni>=0&&ni<n&&nj>=0&&nj<m&&mine[ni][nj]'') sum[i][j]; } for(i=0;i<n;i){ for(j=0;j<m;j++) if(mine[i][j]=='')putchar('*'); else putchar(sum[i][j]+48); putchar('\n'); } return 0; }

#include<iostream> #include<cstring> using namespace std; char a[105][105],b[105][105]; int main(){ int n,m,g; cin >> n >> m; for(int i = 0;i < n;i ++){ for(int j = 0;j < m;j ++){//输入大地图 cin >> a[i][j]; } } for(int i =0;i < n;i ++){ for(int j = 0;j < m;j ++){ g = 0; if(a[i][j] == ''){ b[i][j] = ''; } else { if(i - 1 >= 0 and a[i - 1][j] == ''){//对于每一个方位进行判断 g += 1; } if(i + 1 < n and a[i + 1][j] == ''){ g += 1; } if(j - 1 >= 0 and a[i][j - 1] == ''){ g += 1; } if(j + 1 < m and a[i][j + 1] == ''){ g += 1; } if(i + 1 < n and j + 1 < m and a[i + 1][j + 1] == ''){ g += 1; } if(i - 1 >= 0 and j - 1 >= 0 and a[i - 1][j - 1] == ''){ g += 1; } if(i + 1 < n and j - 1 >= 0 and a[i + 1][j - 1] == ''){ g += 1; } if(i - 1 >= 0 and j + 1 < m and a[i - 1][j + 1] == ''){ g += 1; } b[i][j] = 48 + g; } } } for(int i = 0;i < n;i ++){ for(int j = 0;j < m;j ++){//将带有数据的数组输出 cout << b[i][j]; } cout << endl; } return 0; }

答案在上↑

题解 以下非题解

#if 0 思路: #endif //模块化编程 #include <bits/stdc++.h> using namespace std; int n,m; char b[105][105]; char a[105][105]; void read() { cin>>n>>m; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j]; } char check(char x,int i,int j) { if(x=='') return ''; int ans=0; if(a[i-1][j]'*') ans++; if(a[i+1][j]'') ans++; if(a[i-1][j-1]=='') ans++; if(a[i-1][j+1]'*') ans++; if(a[i+1][j-1]'') ans++; if(a[i+1][j+1]=='') ans++; if(a[i][j-1]'*') ans++; if(a[i][j+1]'*') ans++; return ans+'0'; } void fire() { for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) b[i][j]=check(a[i][j],i,j); } void print() { for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++) cout<<b[i][j]; cout<<endl; } } int main() { read(); fire(); print(); return 0; }

#include <iostream> using namespace std; /* a[n(i),m(j)] a[0,0] a[0,1] a[0,2] a[0,3] a[0,4]... a[1,0] a[2,0 a[3,0] a[4,0] . . . / int main(){ int n ,m; cin >> n >> m; char a[105][105]; 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] == ''){ cout << ''; }else{ int num = 0; if(a[i+1][j] == ''){ num++; } if(a[i][j+1] == ''){ num++; } if(a[i-1][j] == ''){ num++; } if(a[i][j-1] == ''){ num++; } if(a[i+1][j+1] == ''){ num++; } if(a[i-1][j-1] == ''){ num++; } if(a[i+1][j-1] == ''){ num++; } if(a[i-1][j+1] == '*'){ num++; } cout << num; } } cout << endl; } return 0; }

#include<iostream> #include<cmath> using namespace std; char a[110][110]; int main(){ int n,m; cin>>n>>m; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>a[i][j]; } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ int d=0; if(a[i][j]'?'){ if(a[i-1][j]'')d++; if(a[i-1][j-1]=='')d++; if(a[i-1][j+1]'*')d++; if(a[i][j-1]'')d++; if(a[i][j+1]=='')d++; if(a[i+1][j]'*')d++; if(a[i+1][j-1]'')d++; if(a[i+1][j+1]=='')d++; a[i][j]=d+'0'; } } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cout<<a[i][j]; } cout<<endl; } return 0; }

#include<bits/stdc++.h> using namespace std; int main() { long long m,n; char a[200][200]; int b[8][2]={-1,0,0,-1,1,0,0,1,-1,-1,-1,+1,+1,-1,+1,+1},c[200][200]; while(cin>>m>>n) { memset(c,0,sizeof(c)); for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { cin>>a[i][j]; if(a[i][j]'*') { for(int k=0;k<8;k++) c[i+b[k][0]][j+b[k][1]]; } } } for(int i=1;i<=m;i) { for(int j=1;j<=n;j++) { if(a[i][j]'*') { cout<<a[i][j]; } else { cout<<c[i][j]; } } cout<<endl; } } return 0; } 作者是个爆米花！！ 可加ID！！！！！

本人菜，代码太丑请见谅