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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const int MOD = 1000000007;

template <typename T>
void print(const T &v);

vector<vector<int>> grid(55, vector<int>(55, -1));
vector<vector<bool>> seen(55, vector<bool>(55, false));

void dps(int x, int y)
{
    int xs[8] = {1, -1, 0, 0, -1, -1, 1, 1};
    int ys[8] = {0, 0, 1, -1, -1, 1, -1, 1};
    for (int i = 0; i < 8; i++)
    {
        int nx = x + xs[i];
        int ny = y + ys[i];
        if (nx < 0 || ny < 0)
        {
            continue;
        }
        if (seen[nx][ny] || grid[nx][ny] != 1)
        {
            continue;
        }
        seen[nx][ny] = true;
        dps(nx, ny);
    }
}

void init()
{
    for (int i = 0; i < 55; i++)
    {
        for (int j = 0; j < 55; j++)
        {
            grid[i][j] = -1;
            seen[i][j] = false;
        }
    }
}
int main()
{
    while (1)
    {
        int w, h;
        cin >> w >> h;
        if (w == 0 || h == 0)
        {
            return 0;
        }
        init();
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                cin >> grid[i][j];
            }
        }
        int cnt = 0;
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if (seen[i][j] || grid[i][j] != 1)
                {
                    continue;
                }
                ++cnt;
                dps(i, j);
            }
        }
        cout << cnt << endl;
    }
}

// Use For Debug
template <typename T>
void print(T const &v)
{
    for (int i = 0; i < v.size(); i++)
    {
        if (i)
            cout << ' ';
        cout << v[i];
    }
    cout << endl;
}

C++: #include <cstdio>

using namespace std;

char mp[60][60] = {0};
int dx[9] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[9] = {1, -1, 0, 0, 1, -1,-1,  1};

void def(int y, int x){
	mp[y][x] = 0;
	for (int i = 0; i < 8; i++){
		int ty = y + dy[i];
		int tx = x + dx[i];
		if (mp[ty][tx] == '1') def(ty, tx);
	}
}

int main()
{
	int w, h;
	int pi, pj;
	int cnt;
	while (scanf("%d %d", &w, &h), !(w == 0 && h == 0)){
		cnt = 0;
		
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				scanf("%s", &mp[i][j]);
			}
		}
		
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				if (mp[i][j] == '1'){
					def(i, j);
					cnt++;
				}
			}
		}
		
		printf("%d\n", cnt);
	}
}