#include<bits/stdc++.h>
using namespace std;
int n,m;
char a[105][105];
char s[105][105];
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
		fill(s[i],s[i]+105,'0');
	}
	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++){
			if(a[i][j]=='*'){
				if(s[i-1][j]!='*')s[i-1][j]++;
				if(s[i-1][j-1]!='*')s[i-1][j-1]++;
				if(s[i-1][j+1]!='*')s[i-1][j+1]++;
				if(s[i][j-1]!='*')s[i][j-1]++;
				if(s[i][j+1]!='*')s[i][j+1]++;
				if(s[i+1][j]!='*')s[i+1][j]++;
				if(s[i+1][j-1]!='*')s[i+1][j-1]++;
				if(s[i+1][j+1]!='*')s[i+1][j+1]++;
				s[i][j]='*';
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++) cout<<s[i][j];
		cout<<endl;
	}
	return 0;
}

1 comments

  • @ 2024-1-21 10:00:09
    if(s[i-1][j]!='*')s[i-1][j]++;
    if(s[i-1][j-1]!='*')s[i-1][j-1]++;
    if(s[i-1][j+1]!='*')s[i-1][j+1]++;
    if(s[i][j-1]!='*')s[i][j-1]++;
    if(s[i][j+1]!='*')s[i][j+1]++;
    if(s[i+1][j]!='*')s[i+1][j]++;
    if(s[i+1][j-1]!='*')s[i+1][j-1]++;
    if(s[i+1][j+1]!='*')s[i+1][j+1]++;
    数组越界
    
    • 1

    Information

    ID
    980
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    6
    Tags
    # Submissions
    119
    Accepted
    39
    Uploaded By