C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 4963번:섬의 개수(DFS) 답

#include <iostream>
#include <queue>
using namespace std;
int h,w,a[51][51], d[51][51], cnt, dh[] = { 0,0,-1,1,1,1,-1,-1 }, dw[] = { -1,1,0,0,-1,1,-1,1 };
void DFS(int H, int W, int cnt)
{
    d[H][W] = cnt;
    for (int i = 0; i < 8; i++)
    {
        int nw = W + dw[i];
        int nh = H + dh[i];
        if (0<=nh && nh < h && 0<=nw && nw < w)
            if(a[nh][nw] == 1 && d[nh][nw] == 0)
                DFS(nh, nw, cnt);
    }
}
int main() {
    while (1)
    {
        cin >> w>>h;
        if (h == 0 && w == 0) { return 0; }
        cnt = 0;
        for (int i = 0; i < 51; i++)
            for (int j = 0; j < 51; j++)
                a[i][j] = d[i][j] = 0;
        for (int i = 0; i < h; i++)
            for (int j = 0; j < w; j++)
                cin >> a[i][j];
        for (int i = 0; i < h; i++)
            for (int j = 0; j < w; j++)
                if (a[i][j] == 1 && d[i][j] == 0)
                    DFS(i, j, ++cnt);
        cout << cnt << '\n';
    }
}