提交记录 #210
提交时间：2024-11-14 16:42:50
语言：c
状态：Unaccepted
编译情况：编译成功
固定测试点#1:
Accepted
0.000s
236 kB固定测试点#2:
Accepted 0.000s 232 kB额外测试点#1:
Wrong Answer 0.001s 496 kB40【游戏】扫雷:如此传统的游戏，你现在就可以动手来开发
#include<stdio.h>
int main(){
int n=1,m=1;
char boom[100][100]={{'\0'}};
char map[100][100]={{'\0'}};
int i,j,p,q;
int count=1;
int num=0;
//char enter[1]={'\0'};
while (n!=0&&m!=0){
scanf("%d %d",&n,&m);
getchar();
if (n==0&&m==0){
break;
}
if (count>1){
printf("\n");
}
printf("Field #%d:\n",count);
count++;
for (i=0;i<n;i++){
for (j=0;j<m;j++){
scanf("%c",&boom[i][j]);
}
getchar();
}
for (i=0;i<n;i++){
for (j=0;j<m;j++){
if (boom[i][j]=='*'){
map[i][j]='*';
}
else {
if (i!=0){
for (p=i-1,q=j;q<=j+1;q++){
if (boom[p][q]=='*'){
num++;
}
}
}
if (j!=0){
for (p=i,q=j-1;p<=i+1;p++){
if (boom[p][q]=='*'){
num++;
}
}
}
if (i!=0&&j!=0){
if (boom[i-1][j-1]=='*'){
num++;
}
}
if (boom[i][j+1]=='*'){
num++;
}
if (boom[i+1][j]=='*'){
num++;
}
if (boom[i+1][j+1]=='*'){
num++;
}
map[i][j]='0'+num;
num=0;
}
}
}
for (i=0;i<n;i++){
for (j=0;j<m;j++){
printf("%c",map[i][j]);
if (j==m-1){
printf("\n");
}
}
}
}
return 0;
}