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 <iostream>
#include <vector>
#include <algorithm>
long long w, h;
std::vector<std::vector<int>> c;
void dfs(int x, int y){
    c[x][y] = 0;
    for(int i = -1; i <= 1; i++){
        for(int j = -1; j <= 1; j++){
            int newx = x + i, newy = y + j;
            if(0 <= newx && newx < h && 0 <= newy && newy < w && c[newx][newy] == 1) dfs(newx, newy);
        }
    }
}
int main(){
    while(1){
        w = 0;
        h = 0;
        std::cin >> w >> h;
        if(w == 0 && h == 0) break;
        std::vector<std::vector<int>> l;
        c = l;
        c.resize(h, std::vector<int> (w));
        for(int i =0 ; i < h; i++){
            for(int j = 0; j < w; j++) std::cin >> c[i][j];
        }
        long long ans = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(c[i][j] == 1) {
                    dfs(i, j);
                    ans++;
                }
            }
        }
        std::cout << ans << std::endl;
    }
}

C++: #include <iostream>

using namespace std;

int W, H;
int field[55][55];

void input(void){
	cin >> W;
	cin >> H;

	for(int i = 0;i < H;i++){
		for(int j = 0;j < W;j++){
			cin >> field[j][i];
		}
	}
}

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

	for(int dx = -1;dx <= 1;dx++){
		for(int dy = -1;dy <= 1;dy++){
			int nx = x + dx, ny = y + dy;
			if(0 <= nx && nx < W && 0 <= ny && ny < H && field[nx][ny] == 1) dfs(nx, ny);
		}
	}

	return ;
}

int main(){
	while(1){
		int res = 0;
		input();
		if(W == 0 && H == 0) break;

		for(int i = 0;i < H;i++){
			for(int j = 0;j < W;j++){
				if(field[j][i] == 1){
					dfs(j, i);
					res++;
				}
			}
		}

		cout << res << endl;
	}

	return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = {-1,0,1,0}; const int dy[] = {0,1,0,-1};

const int L_MAP = 50 + 2;
bool field[L_MAP][L_MAP];

const bool LAND = true;
const bool SEA = false;

void dfs(int x, int y){
    if(field[y][x] == SEA)
        return;

    field[y][x] = SEA;
    FOR(dy, -1, 1 + 1){
        FOR(dx, -1, 1 + 1){
            dfs(x+ dx, y + dy);
        }
    }
}

int main() {
    int w, h;
    while(cin >> w >> h, w|h){
        fill_n((bool *)field, L_MAP * L_MAP, SEA);
        REP(y, h){
            REP(x, w) {
                cin >> field[y + 1][x + 1];
            }
        }

        int cnt = 0;
        REP(y, h) {
            REP(x, w) {
                if (field[y + 1][x + 1] == LAND) {
                    dfs(x + 1, y + 1);
                    cnt ++;
                }
            }
        }

        cout << cnt << endl;
    }

}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	int W, H;
	while (cin >> W >> H) {
		if (W == 0) return 0;
		vector<vector<int> > V(H, vector<int>(W));
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) cin >> V[i][j];
		}
		int ANS = 0;
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				if (V[i][j] == 1) {
					ANS++;
					queue<pair<int, int> > Q;
					Q.push({ i, j });
					V[i][j] = 0;
					while (!Q.empty()) {
						pair<int, int> P = Q.front();
						Q.pop();
						for (int k = -1; k <= 1; k++) {
							for (int l = -1; l <= 1; l++) {
								int NX = P.first + k, NY = P.second + l;
								if (0 <= NX && NX < H && 0 <= NY && NY < W) {
									if (V[NX][NY] == 1) {
										V[NX][NY] = 0;
										Q.push({ NX, NY });
									}
								}
							}
						}
					}
				}
			}
		}
		cout << ANS << endl;
	}
}