Go: package main

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

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #include<cstdio>
using namespace std;
void func(int,int);
int a,b;
int sima[51][51];
int cnt;
int main(void)
{
	int i,j,x,y;
	scanf("%d",&a);
	scanf("%d",&b);
	while(!(b==0 && a==0)){
		
		for(i=0;i<b;i++){
			for(j=0;j<a;j++){
				scanf("%d",&sima[i][j]);
			}
		}
		cnt=0;
		for(i=0;i<b;i++){
			for(j=0;j<a;j++){
				if(sima[i][j]==1){
					func(i,j);
					cnt++;
				}
			}
		}
		printf("%d\n",cnt);
		scanf("%d",&a);
		scanf("%d",&b);
	}
	return 0;
}
void func(int y,int x)
{
	if(y-1>=0){
		if(sima[y-1][x]==1){
			sima[y-1][x]=0;
			func(y-1,x);
		}
	}
	if(x-1>=0){
		if(sima[y][x-1]==1){
			sima[y][x-1]=0;
			func(y,x-1);	
		}
	}
	if(y+1<=b){
		if(sima[y+1][x]==1){
			sima[y+1][x]=0;
			func(y+1,x);
		}
	}
	if(x+1<=a){
		if(sima[y][x+1]==1){
			sima[y][x+1]=0;
			func(y,x+1);
		}
	}
	if(y-1>=0 && x+1<=a){
		if(sima[y-1][x+1]==1){
			sima[y-1][x+1]=0;
			func(y-1,x+1);
		}
	}
	if(y-1>=0 && x-1>=0){
		if(sima[y-1][x-1]==1){
			sima[y-1][x-1]=0;
			func(y-1,x-1);
		}
	}
	if(y+1<=b && x+1<=a){
		if(sima[y+1][x+1]==1){
			sima[y+1][x+1]=0;
			func(y+1,x+1);
		}
	}
	if(y+1<=b && x-1>=0){
		if(sima[y+1][x-1]==1){
			sima[y+1][x-1]=0;
			func(y+1,x-1);
		}
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(void){
    int w,h;
    while (cin>>w>>h) {
        if (w==0&&h==0) {
            break;
        }
        char c;
        std::vector<vector<char>> vec(h,vector<char>(w));
        bool seen[h][w];
        for (int i=0;i<h;i++) {
            for (int j=0;j<w;j++) {
                cin>>c;
                vec[i][j]=c;
                seen[i][j]=false;
            }
        }
        int count=0;
        for (int i=0;i<h;i++) {
            for (int j=0;j<w;j++) {
                if (vec[i][j]=='1'&&seen[i][j]==false) {
                    seen[i][j]=true;
                    std::stack<pair<int,int>> stk;
                    stk.push(make_pair(i,j));
                    while (stk.size()!=0) {
                        int x=stk.top().first;
                        int y=stk.top().second;
                        if (x+1<h&&seen[x+1][y]==false&&vec[x+1][y]=='1') { //下
                            stk.push(make_pair(x+1,y));
                            seen[x+1][y]=true;
                        } else if (y+1<w&&seen[x][y+1]==false&&vec[x][y+1]=='1') { //右
                            stk.push(make_pair(x,y+1));
                            seen[x][y+1]=true;
                        } else if (x+1<h&&y-1>=0&&seen[x+1][y-1]==false&&vec[x+1][y-1]=='1') { //左下
                            stk.push(make_pair(x+1,y-1));
                            seen[x+1][y-1]=true;
                        } else if (x+1<h&&y+1<w&&seen[x+1][y+1]==false&&vec[x+1][y+1]=='1') { //右下
                            stk.push(make_pair(x+1,y+1));
                            seen[x+1][y+1]=true;
                        } else if (x-1>=0&&y-1>=0&&seen[x-1][y-1]==false&&vec[x-1][y-1]=='1') { //左上
                            stk.push(make_pair(x-1,y-1));
                            seen[x-1][y-1]=true;
                        } else if (x-1>=0&&y+1<w&&seen[x-1][y+1]==false&&vec[x-1][y+1]=='1') { //右上
                            stk.push(make_pair(x-1,y+1));
                            seen[x-1][y+1]=true;
                        } else if (x-1>=0&&seen[x-1][y]==false&&vec[x-1][y]=='1') { //上
                            stk.push(make_pair(x-1,y));
                            seen[x-1][y]=true;
                        } else if (y-1>=0&&seen[x][y-1]==false&&vec[x][y-1]=='1') { //左
                            stk.push(make_pair(x,y-1));
                            seen[x][y-1]=true;
                        } else {
                            stk.pop();
                        }
                    }
                    count++;
                }
            }
        }
        cout<<count<<endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <cstring>
using namespace std;

int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,1,-1,1,-1};
bool seen[60][60];
int H,W;

void dfs(const vector<vector<int> > &Grid, int y, int x){
    seen[y][x] = true;
    for(int i = 0; i < 8; i++){
        int ny = y + dy[i];
        int nx = x + dx[i];
        if(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
        if(seen[ny][nx]) continue;
        if(Grid[ny][nx] == 0) continue;
        dfs(Grid,ny,nx);
    }
}

int main(){
    while(true){
        cin >> W >> H;
        if(!H && !W) break;
        vector<vector<int> > Grid(H,vector<int>(W));
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                cin >> Grid[i][j];
            }
        }
        memset(seen,false,sizeof(seen));
        int cnt = 0;
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                if(Grid[i][j] == 0) continue;
                if(seen[i][j]) continue;
                dfs(Grid,i,j);
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int H,W,k[100][100],n[100][100],color=1,i,j,l,m,o,r;
int main(){while(true){memset(n,0,sizeof(n));r=0;cin>>H>>W;if(H==0){break;}for(i=0;i<H;i++){for(j=0;j<W;j++){cin>>k[i][j];}}
for(i=0;i<H;i++){for(j=0;j<W;j++){if(r==1){color++;}r=0;if(k[i][j]==1 && n[i][j]==0){n[i][j]=color;for(l=0;l<100;l++){
	for(m=0;m<H;m++){for(o=0;o<W;o++){if(n[m][o]==color){
		for(int p=-1;p<=1;p++){for(int q=-1;q<=1;q++){if(m-p>=0 && m-p<H){if(o-q>=0 && o-q<W){n[m][o]=color;}}}}
	}}}
}}}}
cout<<color<<endl;}
}