5 条题解
-
1
#include <bits/stdc++.h> #include <iomanip> #include <ios> #include <iosfwd> #include <istream> #include <ostream> #include <cstring> #include <cstdio> #include <stdio.h> #include <string.h> #include <assert.h> #include <ctype.h> #include <errno.h> #include <float.h> #include <limits.h> #include <locale.h> #include <math.h> #include <stdlib.h> #include <time.h> #include <wchar.h> #include <wctype.h> #include <complex.h> #include <fenv.h> #include <inttypes.h> #include <stdbool.h> #include <stdint.h> #include <tgmath.h> #include <vector> #include <algorithm> #include <cmath> #include <algorithm> #include <bitset> #include <cctype> #include <cerrno> #include <clocale> #include <cmath> #include <complex> #include <cstdlib> #include <ctime> #include <deque> #include <exception> #include <fstream> #include <functional> #include <limits> #include <list> #include <map> #include <queue> #include <set> #include <sstream> #include <stdexcept> #include <streambuf> #include <string> #include <utility> #include <vector> #include <cwchar> #include <cwctype> #include<bits/stdc++.h> using namespace std; char boom[110][110]; int main(){ int m,n; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>boom[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ int dl=0; if(boom[i][j]=='?'){ if(boom[i-1][j-1]=='*') dl++; if(boom[i-1][j]=='*') dl++; if(boom[i-1][j+1]=='*') dl++; if(boom[i][j-1]=='*') dl++; if(boom[i][j+1]=='*') dl++; if(boom[i+1][j-1]=='*') dl++; if(boom[i+1][j]=='*') dl++; if(boom[i+1][j+1]=='*') dl++; boom[i][j]='0'+dl; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cout<<boom[i][j]; } cout<<endl; } } -
1
xuchongrui
LV 5
@ 2024-7-15 14:45:04
`
#include<bits/stdc++.h> using namespace std; char a[110][110]; 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]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ int l=0; if(a[i][j]=='*'){ continue; } if(a[i-1][j+1]=='*'){ l++; } if(a[i][j+1]=='*'){ l++; } if(a[i+1][j+1]=='*'){ l++; } if(a[i+1][j]=='*'){ l++; } if(a[i+1][j-1]=='*'){ l++; } if(a[i][j-1]=='*'){ l++; } if(a[i-1][j-1]=='*'){ l++; } if(a[i-1][j]=='*'){ l++; } a[i][j]=char(l+'0'); } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cout<<a[i][j]; } cout<<endl; } return 0; } -
-1
#include<bits/stdc++.h> using namespace std; bool a[105][105];//一张地图，有雷为一，无雷为零 int main() { memset(a,0,sizeof(a));//地图最开始清空 int n,m; char tmp; cin>>n>>m; for(int i=1;i<=n;i++)//读入地图 { for(int j=1;j<=m;j++) { cin>>tmp;//读入每一个点 if(tmp=='') a[i][j]=1;//如果是地雷就将这个点设为一 } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(a[i][j]==1) printf(""); //如果是地雷不用输出数字 else { printf("%d",a[i+1][j+1]+a[i+1][j-1]+a[i+1][j]+a[i][j+1]+a[i][j-1]+a[i-1][j+1]+a[i-1][j]+a[i-1][j-1]); //将旁边的雷加起来输出 } } printf("\n"); } return 0;//愉快的结束了主程序 }
-
-1
chenbairun
LV 8
@ 2024-7-16 18:00:18
#include<iostream> #include<cstdio> #include<cmath> using namespace std; char a[109][109]; int b[109][109]; int main(){ long long n,m; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]=='*'){ b[i][j+1]++; b[i][j-1]++; b[i+1][j]++; b[i-1][j]++; b[i+1][j+1]++; b[i-1][j-1]++; b[i+1][j-1]++; b[i-1][j+1]++; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]=='*'){ cout<<"*"; }else{ cout<<b[i][j]; } } cout<<endl; } } -
-1
chenxuanrun
LV 4
@ 2024-7-15 15:20:36
#include<bits/stdc++.h> using namespace std; char ge[110][110]; int main(){ int m,n; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>ge[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ int k=0; if(ge[i][j]=='?'){ if(ge[i-1][j-1]=='*') k++; if(ge[i-1][j]=='*') k++; if(ge[i-1][j+1]=='*') k++; if(ge[i][j-1]=='*') k++; if(ge[i][j+1]=='*') k++; if(ge[i+1][j-1]=='*') k++; if(ge[i+1][j]=='*') k++; if(ge[i+1][j+1]=='*') k++; ge[i][j]='0'+k; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cout<<ge[i][j]; } cout<<endl; } }
shenhanzhong
LV 6
@ 2024-12-14 18:18:32
- 1
