Go: package main

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

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), math.MaxInt32)
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		return []byte(f1())
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func gcd64(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return gcd64(b, a%b)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	for {
		ans, ok := solve()
		if !ok {
			break
		}
		println(ans)
	}

}

func solve() (int, bool) {
	w := readInt()
	h := readInt()
	if w == 0 && h == 0 {
		return 0, false
	}

	c := make([][]int, h+2)
	c[0] = make([]int, w+2)
	c[h+1] = make([]int, w+2)
	for i := 1; i-1 < h; i++ {
		c[i] = make([]int, w+2)
		for j := 1; j-1 < w; j++ {
			c[i][j] = readInt()
		}
	}

	var ans int
	for i := 1; i-1 < h; i++ {
		for j := 1; j-1 < w; j++ {
			if 0 < c[i][j] {
				ans++
				dfs(c, i, j)
			}
		}
	}
	return ans, true
}

func dfs(c [][]int, y, x int) {
	c[y][x] = 0
	dx := []int{-1, 0, 1, -1, 1, -1, 0, 1}
	dy := []int{-1, -1, -1, 0, 0, 1, 1, 1}
	for i := range dx {
		nx := x + dx[i]
		ny := y + dy[i]
		if 0 < c[ny][nx] {
			dfs(c, ny, nx)
		}
	}
}

// -----------------------------------------------------------------------------

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