-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminesweeper.cpp
executable file
·97 lines (73 loc) · 2.76 KB
/
minesweeper.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
int main()
{
int count=1,s=1,final[100][100],h=0,r,c,i,j,k,l;
char arr[110][110];
do
{
cin>>r>>c;
if(r==0 && c==0)
break;
memset(final, 0, sizeof(final));
memset(arr,9,sizeof(arr));
for(i=0;i<r;i++)
for(j=0;j<c;j++)
cin>>arr[i][j];
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
k=0;
if(arr[i][j]!=42)
{
if(arr[i-1][j]==42 && (i-1)>=0 )
k+=1;
if(arr[i][j-1]==42 && j-1>=0 )
k+=1;
if(arr[i+1][j]==42 && i+1<=r)
k+=1;
if(arr[i][j+1]==42 && j+1<=c)
k+=1;
if(arr[i+1][j-1]==42 && j-1>=0 && i+1<=r)
k+=1;
if(arr[i-1][j+1]==42 && (i-1)>=0 && j+1<=c )
k+=1;
if(arr[i-1][j-1]==42 && (i-1)>=0 && j-1>=0)
k+=1;
if(arr[i+1][j+1]==42 && i+1<=r && j+1<=c)
k+=1;
arr[i][j]=k;
}
}
}
l=0;
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
final[i][j]=(int)arr[i][j];
//cout<<final[l]<<" ";
}
}
if(count>=2)
cout<<endl;
cout<<"Field #"<<count<<":"<<endl;
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
if(final[i][j]==42)
cout<<(char) final[i][j];
else
cout<<final[i][j];
}
cout<<endl;
}
count++;
}
while(r!=0 && c!=0);
return 0;
}