| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 110053 | 揭伟琦 | 扫雷游戏 | C++ | Wrong Answer | 2 MS | 268 KB | 832 | 2025-02-14 11:53:39 |
Tests(0/10):
Code:
#include<bits/stdc++.h> using namespace std; char mp[101][101]; int main() { int n,m,a=0; 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 <<"8"; } else { if(i-1>=0&&mp[i-1][j]=='*') { a++; } if(i+1<n&&mp[i+1][j]=='*') { a++; } if(j-1>=0&&mp[j-1][i]=='*') { a++; } if(j+1<m&&mp[j+1][i]=='*') { a++; } if(i-1>=0&&j-1>=0&&mp[i-1][j-1]=='*') { a++; } if(i+1<n&&i+1<m&&mp[i+1][j+1]=='*') { a++; } if(i-1>=0&&j+1<m&&mp[i-1][j+1]=='*') { a++; } if(i+1<n&&j-1>=0&&mp[i+1][j-1]=='*') { a++; } } cout <<a; a=0; } cout <<endl; } return 0; }
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-----
0008018010180212011021802800280218022100008000111 01235805148048010001031802238028018080012221101801 018038080180280801311101112101803133320808012211801 03380432128033280221222100123332802333180800111 12804802213348038080180080800001228080348008001332111 18023801180218080804341423223480802280802432128010800 222111180802548028021001238080332253480800080802211 080011135348032380802211802808045422802802124480000 11111318012801012280113132380808003804221080801100 123380180238032121433801121124322804