Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
110055 江信杰 扫雷游戏 C++ Wrong Answer 1 MS 276 KB 873 2025-02-14 11:54:55

Tests(0/10):

Code:

#include <bits/stdc++.h> using namespace std; int n,m; char mp[101][101]; int main() { cin>>n>>m; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { cin>>mp[i][j]; } } for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { if(mp[i][j]=='*') cout<<"*"; else { int lei=0; if(i-1>=0&&mp[i-1][j]=='*') { //正北 lei++; } if(i-1>=0&&mp[i+1][j]=='*') { //正南 lei++; } if(i-1>=0&&mp[i][j-1]=='*') { //正西 lei++; } if(i-1>=0&&mp[i][j+1]=='*') { //正东 lei++; } if(i-1>=0&&mp[i-1][j-1]=='*') { //西北 lei++; } if(i-1>=0&&mp[i-1][j+1]=='*') { //东北 lei++; } if(i-1>=0&&mp[i+1][j-1]=='*') { //西南 lei++; } if(i-1>=0&&mp[i+1][j+1]=='*') { //东南 lei++; } printf("%d\n",lei); } } } }

Run Info:

------Input------

30 40
???*?*???*?????????*?*??*??*???????*????
?????*???*?*????????*???*?*?**?????????*
??*?**?*?**?????????????*???????**?????*
???*?????*???*???????????????*?????**???
??*?*??????*?**?*?**??????**??*?*???????
?*??*??*??***???????????**??**??????*??*
???????**???*?*???????**???????**??**???
?*????????*???**????*?**?????*?*?????*??
???????*??*?????*???????***??*?????**???
????*?*??*????????*??????????*??*???????
???**??*???????*?*???*????*???**?*??????
?**???*??*??*????????*?*?**?*?????*???*?
??
------Answer-----

001*3*202*311000001*3*12*32*3210001*1011
01235*414*5*10000012*213*4*3**112221102*
01*3**3*4**2211000011102*3123321**22212*
023*43213*423*321222100112222*23332**111
12*4*211224*5**2*2**100123**44*2*1133211
1*23*22*32***53312221123**33**343213*21*
2221112**335*4*3100113**4211334**11**321
1*10002333*313**2101*3**43212*4*31245*10
1111122*23*20123*2121223***13*42211**210
0013*3*33*21001233*1111124322*43*2222100
123**43*3221111*2*212*3123*323**3*210111
1**322*23*32*12231114*5*3**3*23344*312*1
23210122
------Your output-----

0
0
0
*0
*0
0
0
*0
0
0
0
0
0
0
0
0
*0
*0
0
*0
0
*0
0
0
0
0
0
0
*0
0
0
0
0
1
2
3
5
*4
1
4
*5
*1
0
0
0
0
0
1
2
*2
1
3
*4
*3
**1
1
2
2
2
1
1
0
2
*0
1
*3
**3
*4
**2
2
1
1
0
0
0
0
1
1
1
0
2
*3
1
2
3
3
2
1
**2
2
2
1
2
*0
2
3
*4
3
2
1
3
*4
2
3
*3
2
1
2
2
2
1
0
0
1
1
2
2
2
2
*2
3
3
3
2
**1
1
1
1
2
*4
*2
1
1
2
2
4
*5
**2
*2
**1
0
0
1
2
3
**4
4
*2
*1
1
3
3
2
1
1
1
*2
3
*2
2
*3
2
***5
3
3
1
2
2
2
1
1
2
3
**3
3
**3
4
3
2
1
3
*2
1
*2
2
2
1
1
1
2
**3
3
5
*4
*3
1
0
0
1
1
3
**4
2
1
1
3
3
4
**1
1
**3
2
1
1
*1
0