HUD 1241 Dfs together with blocks

Problem DescriptionThe Geosurvcomp Geologic Survey company are responsible for detecting underground oil deposits. Geosurvcomp works with one large rectangular region of land at a time, and creates a grid that divides the land into Numer OUs square plots. It then analyzes each plot separately, using a sensing equipment to determine whether or not of the plot contains oil. A plot containing oil is called a pocket. If the pockets is adjacent, then they is part of the same oil deposit. Oil deposits can is quite large and may contain numerous pockets. Your job is to determine how many different oil deposits be contained in a grid.

Inputthe input file contains one or more grids. Each of the grids begins with a line containing M and N, the number of rows and columns in the grid, separated by a single space. If m = 0 It signals the end of the input; Otherwise 1 <= m <= and 1 <= n <= 100. Following this is m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and are either ' * ', representing the absence of oil, or ' @ ', representing a oil PO Cket.

Outputfor each grid, output the number of distinct oil deposits. The different pockets is part of the same oil deposit if they is adjacent horizontally, vertically, or diagonally. An oil deposit won't contain more than pockets.

Sample Input1 1*3 5*@*@***@***@*@*1 8@@****@*5 5****@*@@*@*@**@@@@*@@@**@0 0

#include <stdio.h> #include <iostream> #include <string> #include <string.h> #include <cmath > #include <math.h> #include <algorithm> #include <set> #include <map>using namespace std;#    Define MAXN 1000int Hang,lie;char map[maxn][maxn];int dir[8][2] = {{1,0}, { -1,0}, {0,1}, {0,-1}, {.    {1,-1}, { -1,1}, { -1,-1}};void dfs (int x,int y) {map[x][y] = ' * ';        for (int i = 0; i < 8; i++) {int xx = x + dir[i][0];        int yy = y + dir[i][1];        if (xx >= 0 && xx < hang && yy >= 0 && yy < lie && map[xx][yy]! = ' * ')        {DFS (XX,YY);        }}}int Main () {while (Cin >> hang >> lie,hang+lie) {int k = 0;        for (int i = 0; i < hang; i++) {scanf ("%s", Map[i]);                } for (int i = 0, i < hang; i++) {for (int j = 0; J < Lie; J + +) { if (map[i][J] = = ' @ ') {DFS (I,J);                k++;    }}} printf ("%d\n", K); }}

　　

Sample Output0 1 2 2

HUD 1241 Dfs together with blocks