- [NOIP2015 普及组] 扫雷游戏
有没有巨学教教我
- 2024-1-20 9:31:31 @
帮我找一下错
#include <map>
#include <set>
#include <ios>
#include <list>
#include <cmath>
#include <ctime>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <cwchar>
#include <cstdio>
#include <fenv.h>
#include <iosfwd>
#include <string>
#include <limits>
#include <math.h>
#include <cstdlib>
#include <iomanip>
#include <clocale>
#include <complex>
#include <cstring>
#include <cstring>
#include <cwctype>
#include <istream>
#include <ostream>#include <sstream>
#include <fstream>
#include <utility>
#include <stdio.h>
#include <iostream>
#include <stdint.h>
#include <string.h>
#include <tgmath.h>
#include <complex.h>
#include <algorithm>
#include <exception>
#include <stdbool.h>
#include <stdexcept>
#include <streambuf>
#include <functional>
#include <inttypes.h>
#include <bits/stdc++.h>using namespace std;
char a[105][105];
char c[105][105];
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];
if(a[i][j] == '?') c[i][j] = '0';
else c[i][j] = '*';
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
if(c[i][j] == '*'){
c[i - 1][j - 1] += 1;
c[i - 1][j] += 1;
c[i - 1][j ```+ 1] += 1;c[i][j - 1] += 1;
c[i][j + 1] += 1;
c[i + 1][j - 1] += 1;
c[i + 1][j] += 1;
c[i + 1][j + 1] += 1;
}
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
cout << c[i][j];
}
cout << endl;
}
return 0;
}
1 comments
-
C23liupeilin LV 10 @ 2024-1-26 8:59:39
c[i - 1][j - 1] += 1; c[i - 1][j] += 1; c[i - 1][j ```+ 1] += 1;c[i][j - 1] += 1; c[i][j + 1] += 1; c[i + 1][j - 1] += 1; c[i + 1][j] += 1; c[i + 1][j + 1] += 1;
数组越界
- 1
Information
- ID
- 980
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 6
- Tags
- # Submissions
- 119
- Accepted
- 39
- Uploaded By