1 solutions
-
1
我爱抢沙发
#include<bits/stdc++.h> using namespace std; int arr[101][101]={}; int n,m; int much(int a,int b){ int sum=0; for(int i=max(a-1,0);i<=min(n,a+1);i++){ for(int j=max(b-1,0);j<=min(b+1,m);j++){ if(arr[i][j]==-1){ sum++; } } } return sum; } int main(){ cin>>n>>m; char t; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>t; if(t=='*'){ arr[i][j]=-1; } } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(arr[i][j]!=-1){ arr[i][j]=much(i,j); } } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(arr[i][j]==-1){ cout<<"*"; continue; } cout<<arr[i][j]; } cout<<endl; } }
- 1
Information
- ID
- 1708
- Time
- 1000ms
- Memory
- 125MiB
- Difficulty
- 1
- Tags
- # Submissions
- 6
- Accepted
- 4
- Uploaded By