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 <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>

using namespace std;

inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}

typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

const double EPS = 1e-10;

int seamap[52][52];
static int num = 0;

void dfs(int x, int y) {
	if(seamap[x][y] == 1) {

	if(seamap[x-1][y-1]) {
		seamap[x-1][y-1] = 0;
		dfs(x-1, y-1);
	}
	else if(seamap[x][y-1]) {
		seamap[x][y-1] = 0;
		dfs(x, y-1);
	}
	else if(seamap[x+1][y-1]) {
		seamap[x+1][y-1] = 0;
		dfs(x+1, y-1);
	}
	else if(seamap[x-1][y]) {
		seamap[x-1][y] = 0;
		dfs(x-1, y);
	}
	else if(seamap[x+1][y]) {
		seamap[x+1][y] = 0;
		dfs(x+1, y);
	}
	else if(seamap[x-1][y+1]) {
		seamap[x-1][y+1] = 0;
		dfs(x-1, y+1);
	}
	else if(seamap[x][y+1]) {
		seamap[x][y+1] = 0;
		dfs(x, y+1);
	}
	else if(seamap[x+1][y+1]) {
		seamap[x+1][y+1] = 0;
		dfs(x+1, y+1);
	}
	else {
		++num;
	}

	}
}


int main() {
	int w, h;

	REP(i, 52) {
		REP(j, 52) {
			seamap[i][j] = 0;
		}
	}

	while(cin >> w >> h, (w!=0 && h!=0)) {
		FOR(i, 1, h+1) {
			FOR(j, 1, w+1) {
				int p;
				cin >> p;
				seamap[i][j] = p;
			}
		}

		FOR(i, 1, h+1) {
			seamap[i][w+1] = 0;
		}

		FOR(j, 1, w+1) {
			seamap[h+1][j] = 0;
		}
	
		num = 0;

		FOR(i, 1, 50) {
			FOR(j, 1, 50) {
				dfs(i, j);
			}
		}

		cout << num << endl;
	}
}

C++: #include <iostream>

#include <string>
#include <queue>

using namespace std;

int main(){
	int w,h;
	int data[60][60];
	int flag[60][60];
	int dx[8] ={-1,-1,-1,0,1,1,1,0};
	int dy[8] ={-1,0,1,1,1,0,-1,-1};

	while(1){
		cin>>w>>h;
		if(w==0 && h==0)break;

	for(int i=0;i<60;i++){
		for(int j=0;j<60;j++){
			data[i][j]=-1;
			flag[i][j]=0;
		}
	}

	char tmp;
	int startX;
	int startY;
	int cnt=0;

	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cin>>tmp;
			if(tmp=='1')data[i][j] = 0;
		}
	}

	queue<int> qX,qY;
	
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(data[i][j]==0 && flag[i][j]==0){
				flag[i][j]=1;
				qX.push(j);
				qY.push(i);
				cnt++;
			}
			else continue;

			while(qX.size()!=0){
				int topX = qX.front();
				int topY = qY.front();
				qX.pop();
				qY.pop();

				for(int i=0;i<8;i++){
					int nowX = topX + dx[i];
					int nowY = topY + dy[i];

					if(data[nowY][nowX] ==0 && flag[nowY][nowX] == 0){
						qX.push(nowX);
						qY.push(nowY);
						flag[nowY][nowX]=1;
					}
				}
			}
		}
	}

	cout<<cnt<<endl;
	}

	return 0;
}

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

int w, h;

void dfs(int hh, int ww, vector<vector<int>> &c, vector<vector<bool>> &seen)
{
    int dh[8] = {1, 1, 1, 0, 0, -1, -1, -1};
    int dw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
    seen[hh][ww] = true;
    for (int i = 0; i < 8; i++)
    {
        int hhh = hh + dh[i];
        int www = ww + dw[i];
        if (hhh < 1 || hhh > h || www < 1 || www > w)
        {
            continue;
        }
        if (c[hhh][www] == 0)
        {
            continue;
        }
        if (seen[hhh][www])
        {
            continue;
        }
        dfs(hhh, www, c, seen);
    }
}

int main()
{
    vector<int> ans;
    while (1)
    {
        cin >> w >> h;
        if (w == 0 && h == 0)
            break;
        vector<vector<int>> c(h + 1, vector<int>(w + 1));
        vector<vector<bool>> seen(h + 1, vector<bool>(w + 1, false));
        for (int i = 1; i <= h; i++)
        {
            for (int j = 1; j <= w; j++)
            {
                cin >> c[i][j];
                if (c[i][j] == 0)
                {
                    seen[i][j] = true;
                }
            }
        }
        int count = 0;
        for (int i = 1; i <= h; i++)
        {
            for (int j = 1; j <= w; j++)
            {
                if (seen[i][j] || c[i][j] == 0)
                    continue;
                dfs(i, j, c, seen);
                count++;
            }
        }
        ans.push_back(count);
    }
    for (int i : ans)
    {
        cout << i << endl;
    }
}