hd_Mine sweeping

#include <iostream> #include <stdlib.h> using namespace std; //#define DEBUG const int SIZE = 105; bool visited[SIZE][SIZE]; int mark[SIZE][SIZE]; char map[SIZE][SIZE]; int n; void test(int r, int c) { if(!visited[r][c]){ if(mark[r][c] != 0) { visited[r][c] = true; return ; } else { visited[r][c] =true; for(int i=r-1; i<=r+1; ++i) { for(int j=c-1; j<=c+1; ++j) { if(i == r && j == c) continue; if(i >= 0 && i < n && j >= 0 && j < n) test(i,j); } } } } } int main ( int argc, char *argv[] ) { while(cin>>n) { memset(visited,0,sizeof(visited)); memset(mark,0,sizeof(mark)); memset(map,0,sizeof(map)); for(int i=0; i<n; ++i) { cin>>map[i]; } //getmark; for(int i=0; i<n; ++i) { for(int j=0; j<n; ++j) { for(int ii=i-1; ii<=i+1; ++ii) { for(int jj=j-1; jj<=j+1;++jj) { if(ii >= 0 && ii < n && jj >=0 && jj<n/ && map[ii][jj] == 'X') { mark[i][j]++; } } } } } #ifdef DEBUG cout<<"++++++++++"<<endl; for(int i=0; i<n; ++i) { for(int j =0; j<n; ++j) { cout<<mark[i][j]; } cout<<endl; } cout<<"++++++++++"<<endl; #endif int r,c; cin>>r>>c; if(map[r][c] == 'X') cout<<"it is a beiju!"<<endl; else { test(r,c); for(int i=0; i<n; ++i) { for(int j=0; j<n; ++j) { if(visited[i][j]) cout<<mark[i][j]; else cout<<"."; } cout<<endl; } } cout<<endl; } return EXIT_SUCCESS; } /* ---------- end of function main ---------- */