#include<iostream>
using namespace std;
char a[101][101];
int b[101][101];
int main(){
    int n,m;
    cin>>n>>m;
    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]!='*'){
    			int s=0;
    	    if(a[i+1][j+1]=='*'){
    	    	s++;
			}
			if(a[i][j+1]=='*'){
    	    	s++;
			}
			if(a[i+1][j]=='*'){
    	    	s++;
			}
			if(a[i-1][j-1]=='*'){
    	    	s++;
			}
			if(a[i-1][j]=='*'){
    	    	s++;
			}
			if(a[i][j-1]=='*'){
    	    	s++;
			}
			if(a[i-1][j+1]=='*'){
    	    	s++;
			}
			if(a[i+1][j-1]=='*'){
    	    	s++;
			}
			cout<<s;
			}
			else{
				cout<<"*";
			}	
	}
	cout<<endl;
	}
	/*for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    	    if(a[i][j]!='*'){
    	    	cout<<b[i][j];
			}
			else{
    	    	cout<<"*";
			}
	}
	cout<<endl;
	}*/
}
using namespace std;
char a[101][101];
int b[101][101];
int main(){
int n,m;
cin>>n>>m;
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]!='*'){
int s=0;
if(a[i+1][j+1]=='*'){
s++;
}
if(a[i][j+1]=='*'){
s++;
}
if(a[i+1][j]=='*'){
s++;
}
if(a[i-1][j-1]=='*'){
s++;
}
if(a[i-1][j]=='*'){
s++;
}
if(a[i][j-1]=='*'){
s++;
}
if(a[i-1][j+1]=='*'){
s++;
}
if(a[i+1][j-1]=='*'){
s++;
}
b[i][j]=s;
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]!='*'){
cout<<b[i][j];
}
else{
cout<<"*";
}
}
cout<<endl;
}
}


0 comments

No comments so far...

Information

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