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<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
    int W, H;
    int island[55][55];
    int ans;
    vector<int> ansarr;
    queue<pair<int, int> > que;
    pair<int, int> state;
    while(true){
        cin>>W>>H;
        if((W==0) && (H==0)) break;
        for(int i=0;i<H;++i){
            for(int j=0;j<W;++j){
                cin>>island[i][j];
            }
        }
        ans = 0;
        for(int i=0;i<H;++i){
            for(int j=0;j<W;++j){
                if(island[i][j]==1){
                    ans++;
                    que.push(mp(i, j));
                    while(!que.empty()){
                        state = que.front();que.pop();
                        if(island[state.fi][state.se]==0) continue;
                        island[state.fi][state.se] = 0;
                        if((state.fi>0) && (island[state.fi-1][state.se]==1)){
                            que.push(mp(state.fi-1, state.se));
                        }
                        if((state.fi<H-1) && (island[state.fi+1][state.se]==1)){
                            que.push(mp(state.fi+1, state.se));
                        }
                        if((state.se>0) && (island[state.fi][state.se-1]==1)){
                            que.push(mp(state.fi, state.se-1));
                        }
                        if((state.se<W-1) && (island[state.fi][state.se+1]==1)){
                            que.push(mp(state.fi, state.se+1));
                        }
                        if((state.fi>0) && (state.se>0) && (island[state.fi-1][state.se-1]==1)){
                            que.push(mp(state.fi-1, state.se-1));
                        }
                        if((state.fi>0) && (state.se<W-1) && (island[state.fi-1][state.se+1]==1)){
                            que.push(mp(state.fi-1, state.se+1));
                        }
                        if((state.fi<H-1) && (state.se>0) && (island[state.fi+1][state.se-1]==1)){
                            que.push(mp(state.fi+1, state.se-1));
                        }
                        if((state.fi<H-1) && (state.se<W-1) && (island[state.fi+1][state.se+1]==1)){
                            que.push(mp(state.fi+1, state.se+1));
                        }
                    }
                }
            }
        }
        ansarr.push_back(ans);
    }
    for(int i=0;i<ansarr.size();++i){
        cout<<ansarr[i]<<endl;
    }
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int m[55][55];

void fill_(int x,int y,int i){
    if(m[x][y]!=1){
        return;
    }
    m[x][y]=i;
    for(int dx=-1;dx<=1;++dx){
        for(int dy=-1;dy<=1;++dy){
            if(dx||dy){
                fill_(x+dx,y+dy,i);
            }
        }
    }
}

int main(void){
    // Your code here!
    while(1){
        for(int i=0;i<55;++i)fill(m[i],m[i]+55,-1);
        
        
        int w,h;
        cin>>w>>h;
        if(w==0&&h==0)break;
        for(int x=0; x<h;++x){
            for(int y=0;y<w;++y){
                int t;cin>>t;
                m[x+1][y+1]=t;
            }
        }
        int res=0;
        for(int x=1;x<=h;++x){
            for(int y=1;y<=w;++y){
                if(m[x][y]==1){
                    ++res;
                    fill_(x,y,res+1);
                }
            }
        }
        cout<<res<<endl;
    }
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int w, h;
char c[51][51];

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 nx = x + i, ny = y + j;
			if (0 <= nx&&nx < h && 0 <= ny&&ny < w&&c[nx][ny])
				dfs(nx, ny);
		}
	}
}
int main() {
	while (scanf("%d%d", &w, &h), w) {
		rep(i, h)rep(j, w)scanf("%d", &c[i][j]);
		int cnt = 0;
		rep(i, h)rep(j, w) {
			if (c[i][j]) {
				dfs(i, j);
				cnt++;
			}
		}
		printf("%d\n", cnt);
	}
}

C++: #include <iostream>
using namespace std;
int W,H,c[50][50];
void island(int h, int w){
    c[h][w]=0;
    for(int i=h-1; i<h+2; i++){
        for(int j=w-1; j<w+2; j++){
            if(c[i][j]==1 && i>=0 && j>=0 && i<H && j<W) island(i,j);
        }
    }
}

int main(void){
    int count;
    while(1){
        cin>>W>>H;
        count=0;
        if(W==0 && H==0) break;
        for(int i=0; i<H; i++){
            for(int j=0; j<W; j++){
                cin>>c[i][j];
            }
        }
        for(int i=0; i<H; i++){
            for(int j=0; j<W; j++){
                if(c[i][j]==1){
                    count++;
                    island(i,j);
                }
            }
        }
        cout<<count<<endl;
    }
}