Go: package main

import (
	"fmt"
)

func main() {
	var h, w int
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			return
		}
		matrix := make([][]int, h)
		Sean := make([][]bool, h)
		for i := 0; i < h; i++ {
			matrix[i] = make([]int, w)
			Sean[i] = make([]bool, w)
			for j := 0; j < w; j++ {
				fmt.Scan(&matrix[i][j])
			}
		}
		var count int
		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				if matrix[i][j] == 1 && Sean[i][j] == false {
					search(i, j, h, w, matrix, Sean)
					count++
				}
			}
		}
		fmt.Println(count)
	}
}
func search(x int, y int, h int, w int, matrix [][]int, Sean [][]bool) {
	if x < 0 || y < 0 || x >= h || y >= w || matrix[x][y] == 0 {
		return
	}
	if Sean[x][y] == true {
		return
	}

	Sean[x][y] = true

	search(x+1, y, h, w, matrix, Sean)
	search(x-1, y, h, w, matrix, Sean)
	search(x, y+1, h, w, matrix, Sean)
	search(x, y-1, h, w, matrix, Sean)
	search(x+1, y-1, h, w, matrix, Sean)
	search(x-1, y+1, h, w, matrix, Sean)
	search(x+1, y+1, h, w, matrix, Sean)
	search(x-1, y-1, h, w, matrix, Sean)
}

C++: #include <iostream>
using namespace std;
int totalRow, totalColumn;


void dfs(int input[50][50], bool visitedIsland[50][50],int row, int col)
{
    //cout << row << " " << col << endl ;
    visitedIsland[row][col] = true;
    if (row < totalRow   && col < totalColumn )
    {
        //Up
        if (row > 0 && input[row - 1][col] == 1 && visitedIsland[row - 1][col] == false)
            dfs(input,visitedIsland,row - 1,col);
        //cout << "up " << row << " " << col << input[row - 1][col] << " " << visitedIsland[row - 1][col] << endl;
        //Down
        if ((row + 1 <= totalRow - 1) && input[row + 1][col] == 1 && visitedIsland[row + 1][col]== false)
            dfs(input,visitedIsland,row + 1,col);
        //cout << "down " << input[1][col] << " " <<visitedIsland[row + 1][col] << endl;
        //Left
        if (col > 0 && input[row][col-1] == 1 && visitedIsland[row][col-1]== false)
            dfs(input,visitedIsland,row,col - 1);
        //cout << "left" << endl;
        //Right
        if ((col + 1 <= totalColumn - 1)&&input[row][col + 1] == 1 && visitedIsland[row][col+1]== false)
            dfs(input,visitedIsland,row,col + 1);
        //Left bottom diagonal
        if (row > 0 && col > 0 && input[row - 1][col - 1] == 1 && visitedIsland[row - 1][col - 1]== false)
            dfs(input,visitedIsland,row - 1,col - 1);
        //cout << "Left bottom " << row << " " << col << input[row - 1][col-1] << " " << visitedIsland[row - 1][col-1] << endl;
        //Left top diagonal
        if ((row + 1 <= totalRow - 1) && col > 0 && input[row + 1][col - 1] == 1 && visitedIsland[row + 1][col - 1]== false)
            dfs(input,visitedIsland,row + 1,col - 1);
        //Right top diagonal
        if ((col + 1 <= totalColumn - 1)&&row > 0 && input[row - 1][col + 1] == 1 && visitedIsland[row - 1][col + 1]== false)
            dfs(input,visitedIsland,row - 1,col +1);
        //cout << "Right top " << row << " " << col << input[row - 1][col+1] << " " << visitedIsland[row - 1][col+1] << endl;
        //Right bottom diagonal
        if ((row + 1 <= totalRow - 1)&&(col + 1 <= totalColumn - 1)&& input[row + 1][col + 1] == 1 && visitedIsland[row + 1][col + 1]== false)
            dfs(input,visitedIsland,row + 1,col +1);
    }
    
}

int main(int argc, const char * argv[]) {
    int row, col;
    while (cin >> col >> row)
    {
        totalRow = row;
        totalColumn = col;
        int numofIsland = 0;
        int input[50][50] = {0};
        bool visitedIsland[50][50] = {false};
        for (int i= 0; i < row; i++)
            for (int j = 0; j < col; j++)
                cin >> input[i][j];
        //checking
        //cout << input[1][0] << " " << input[0][0]<< endl;
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++)
            {
                if (input[i][j] == 1 && !visitedIsland[i][j])
                {
                    //push neighbour
                    numofIsland++;
                    //processed = true;
                    //cout << i << " " << j << endl ;
                    dfs(input,visitedIsland,i,j);
                }
            }
        }
        if (row > 0 &&  col > 0)
            cout << numofIsland << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int w, h;
int field[51][51];
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};

void dfs(int x, int y)
{
    field[y][x] = -1;

    for (int i = 0; i < 8; i++)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];

        if (nx < 0 || ny < 0 || nx >= w || ny >= h)
            continue;

        if (field[ny][nx] == 1)
            dfs(nx, ny);
    }
}

int main()
{
    while (cin >> w >> h, w || h)
    {
        for (int y = 0; y < h; y++)
        {
            for (int x = 0; x < w; x++)
            {
                cin >> field[y][x];
            }
        }

        int ans = 0;

        for (int y = 0; y < h; y++)
        {
            for (int x = 0; x < w; x++)
            {
                if (field[y][x] == 1)
                {
                    dfs(x, y);
                    ans++;
                }
            }
        }

        cout << ans << endl;
    }

    return 0;
}