Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

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

using namespace std;

typedef long long ll;

template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void solve(int cur_x, int cur_y, vector<vector<bool>> &visited,
        const int H, const int W, const vector<vector<int>> &field) {
    visited[cur_y][cur_x] = true;

    vector<pair<int, int>> diff_xy = {
        {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}
    };
    for (int i = 0; i < (int) diff_xy.size(); i++) {
        int next_x = cur_x + diff_xy[i].first;
        int next_y = cur_y + diff_xy[i].second;
        if (next_x < 0 || next_x >= W || next_y < 0 || next_y >= H) continue;
        if (visited[next_y][next_x]) continue;
        if (field[next_y][next_x] == 0) continue;
        solve(next_x, next_y, visited, H, W, field);
    }
}

int main(void) {
    while (1) {
        int w, h;
        cin >> w >> h;

        if (w == 0 && h == 0) break;

        vector<vector<int>> field(h, vector<int>(w));
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> field[i][j];
            }
        }

        vector<vector<bool>> visited(h, vector<bool>(w, false));
        int count = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (visited[i][j]) continue;
                if (field[i][j] == 0) continue;
                solve(j, i, visited, h, w, field);
                count++;
            }
        }

        cout << count << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a,int b){return b?GCD(b,a%b):a;}
int LCM(int a,int b){return (a*b)/GCD(a,b);}
int abs(int x){return x>0?x:-x;}
 
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int sea[50][50];
int w, h;
void dfs(int x, int y)
{
	sea[x][y] = 0;
	for (int i = 0; i < 8; i++){
		int nx = x + dx[i], ny = y + dy[i];
		if (0 <= nx and nx < h and 0 <= ny and ny < w and sea[nx][ny] == 1){
			dfs(nx, ny);
		}
	}

	return;
}

int main()
{
	while (1){
		int ans = 0;
		cin >> w >> h;
		if (!w and !h) return 0;
		REP(i, h){
			REP(j, w){
				cin >> sea[i][j];
			}
		}

		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				if (sea[i][j] == 1){
					dfs(i, j);
					ans++;
				}
			}
		}

		cout << ans << endl;
	}

}

C++: #include <cstdio>

int w, h, c[50][50], count = 0;

void search(int x, int y)
{
    c[y][x] = 0;

    for (int dx = -1; dx <= 1; ++dx)
    {
        for (int dy = -1; dy <= 1; ++dy)
        {
            if (x + dx < 0 || x + dx >= w || y + dy < 0 || y + dy >= h)
            {
                continue;
            }

            if (c[y + dy][x + dx] == 1)
            {
                search(x + dx, y + dy);
            }
        }
    }
}

bool sub_search()
{
    for (int i = 0; i < h; ++i)
    {
        for (int j = 0; j < w; ++j)
        {
            if (c[i][j] == 1)
            {
                search(j, i);
                count++;
                return true;
            }
        }
    }

    return false;
}

int main()
{
    while (true)
    {
        scanf("%d %d", &w, &h);
        if (w == 0 && h == 0)
        {
            break;
        }

        for (int i = 0; i < h; ++i)
        {
            for (int j = 0; j < w; ++j)
            {
                scanf("%d", &c[i][j]);
            }
        }

        count = 0;

        while (sub_search())
        {
        }

        printf("%d\n", count);
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<pair<int, int>> directions = {
    {1,0}, {0,1}, {-1,0}, {0,-1}, {1,1}, {1,-1}, {-1,1}, {-1,-1}
};
void dfs(Graph &chart, int x, int y) {
    int H = chart.size(), W = chart[0].size();
    chart[x][y] = -1;
    for (int i = 0; i < directions.size(); i++) {
        int nx = x + directions[i].first;
        int ny = y + directions[i].second;
        if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;
        if (chart[nx][ny] == 1) dfs(chart, nx, ny);
    }
}

int main() {
    while (true) {
        int H, W;
        cin >> W >> H;
        if (H == 0 && W == 0) break;
        Graph chart(H, vector<int>(W));
        for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
            cin >> chart[i][j];
        }
        int cnt = 0;
        for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
            if (chart[i][j] == 1) {
                dfs(chart, i, j);
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}