Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

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;
}