5 solutions
-
-5
解题报告
撰写人: 杜嘉乐
难度等级
★★★★★
参考程序
#include<bits/stdc++.h> using namespace std; int n,m,nx,ny,sum; int dx[8]={-1,-1,0,1,1,1,0,-1}; int dy[8]={0,1,1,1,0,-1,-1,-1}; char a[105][105],c[105][105]; int main(){ cin>>n>>m; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>c[i][j]; } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(c[i][j]=='*') cout<<"*"; else{ sum=0; for(int k=0;k<8;k++){ nx=i+dx[k]; ny=j+dy[k]; if(nx>=0&&nx<n&&ny>=0&&ny<m&&c[nx][ny]=='*') sum++; } cout<<sum; } } cout<<endl; } return 0; }
Information
- ID
- 293
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 50
- Accepted
- 29
- Uploaded By