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>
using namespace std;
struct Point
{
	int x;
	int y;
	Point(int x = 0, int y = 0) :x(x), y(y) {}
};
const int MAX = 50;
int map[MAX][MAX];
bool book[MAX][MAX];
void depthFSearch(int h, int w, Point start)
{
	int next[9][2] = { { -1,-1 },{ -1,0 },{ -1,1 },{ 0,-1 },{ 0,0 },{ 0,1 },{ 1,-1 },{ 1,0 },{ 1,1 } };
	for (int k = 0; k <= 8; k++)
	{
		int nx = start.x + next[k][0];
		int ny = start.y + next[k][1];
		if (nx < 0 || nx >= h || ny < 0 || ny >= w || !map[nx][ny])
			continue;
		if (!book[nx][ny] && map[nx][ny])
		{
			book[nx][ny] = true;
			Point p = { nx,ny };
			depthFSearch(h, w, p);
		}
	}
	return;
}
int main()
{
	while (true)
	{
		int w, h;
		cin >> w >> h;
		if (!w && !h)
			break;
		for (int i = 0; i < h; i++)
			for (int j = 0; j < w; j++)
			{
				cin >> map[i][j];
				book[i][j] = false;
			}
		int sum = 0;
		for (int i = 0; i < h; i++)
			for (int j = 0; j < w; j++)
			{
				if (!book[i][j] && map[i][j])
				{
					book[i][j] = true;
					Point start(i, j);
					depthFSearch(h, w, start);
					sum++;
				}
			}
		cout << sum << endl;
	}
}

C++: #include<stdio.h>
#include<iostream>
#include<string>
using namespace std;

int main(){

	
	int w,h;
	while(1){
		cin>>w>>h;if(w==0&&h==0)break;
		int n[51][51]={};
	bool N[51][51]={};
		for(int i=0;i<h;i++)
			for(int j=0;j<w;j++)
			{int x;cin>>x;if(x==1)N[i][j]=true;}

		int c=0;
		for(int i=0;i<h;i++)
			for(int j=0;j<w;j++)
			{if(N[i][j]==true&&n[i][j]==0){
				c++;
				n[i][j]=c;
				if(n[i-1][j+1]==0)n[i-1][j+1]=c;
				if(n[i-1][j]==0)n[i-1][j]=c;
				if(n[i-1][j-1]==0)n[i-1][j-1]=c;
				if(n[i][j+1]==0)n[i][j+1]=c;
				if(n[i-1][j]==0)n[i-1][j]=c;
				if(n[i+1][j+1]==0)n[i+1][j+1]=c;
				if(n[i+1][j]==0)n[i+1][j]=c;
				if(n[i+1][j-1]==0)n[i+1][j-1]=c;
			}
			else if(N[i][j]==true&&n[i][j]>0){
				int y=n[i][j];
				n[i-1][j+1]=y;
				n[i-1][j]=y;
				n[i-1][j-1]=y;
				n[i][j+1]=y;
				n[i-1][j]=y;
				n[i+1][j+1]=y;
				n[i+1][j]=y;
				n[i+1][j-1]=y;
			}
			}

			for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				int t=n[i][j];
				if(N[i][j]==true&&N[i][j+1]==true&&t>n[i][j+1])t=n[i][j+1];
				if(N[i][j]==true&&N[i][j-1]==true&&t>n[i][j-1])t=n[i][j-1];
				if(N[i][j]==true&&N[i+1][j+1]==true&&t>n[i+1][j+1])t=n[i+1][j+1];
				if(N[i][j]==true&&N[i+1][j]==true&&t>n[i+1][j])t=n[i+1][j];
				if(N[i][j]==true&&N[i+1][j-1]==true&&t>n[i+1][j-1])t=n[i+1][j-1];
				if(N[i][j]==true&&N[i-1][j+1]==true&&t>n[i-1][j+1])t=n[i-1][j+1];
				if(N[i][j]==true&&N[i-1][j]==true&&t>n[i-1][j])t=n[i-1][j];
				if(N[i][j]==true&&N[i-1][j-1]==true&&t>n[i-1][j-1])t=n[i-1][j-1];
				if(n[i][j]>t){
					for(int ii=0;ii<h;ii++)
			for(int jj=0;jj<w;jj++){
				if(n[i][j]==n[ii][jj])n[ii][jj]=t;
			}
				}
			}
			}

			int max=0;
			for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(N[i][j]==true&&n[i][j]>max)max=n[i][j];
			}}
			cout<<max<<endl;
			}
return 0;
}

C++: #include <iostream>
#include <queue>
#include <stdio.h>

using namespace std;

#define NUM 50

int w, h;
int c[NUM][NUM];
bool visited[NUM][NUM];
queue<pair<int, int> > Q;

void init(){
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            visited[i][j] = false;
        }
    }
}

bool can_visit(int i, int j){
    if(i < 0 || h <= i || j < 0 || w <= j){
        return false;
    }
    if(visited[i][j] || c[i][j] == 0){
        return false;
    }
    return true;
}

pair<int, int> find_new_place(){
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(can_visit(i, j)){
                return make_pair(i, j);
            }
        }
    }

    return make_pair(-1, -1);
}

bool exec(void){
    scanf("%d %d", &w, &h);
    if(w == 0 && h == 0){
        return false;
    }

    init();

    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            scanf("%d", &c[i][j]);
        }
    }

    int count = 0;

    while(true){
        pair<int, int> new_place = find_new_place();
        if(new_place.first == -1){
            break;
        }

        count++;

        Q.push(new_place);
        visited[new_place.first][new_place.second] = true;
        while(!Q.empty()){
            pair<int, int> p = Q.front(); Q.pop();
            int x = p.first;
            int y = p.second;

            vector<pair<int, int> > v;
            v.push_back(make_pair(x, y + 1));
            v.push_back(make_pair(x, y - 1));
            v.push_back(make_pair(x + 1, y + 1));
            v.push_back(make_pair(x + 1, y));
            v.push_back(make_pair(x + 1, y - 1));
            v.push_back(make_pair(x - 1, y + 1));
            v.push_back(make_pair(x - 1, y));
            v.push_back(make_pair(x - 1, y - 1));

            for(auto&& item : v){
                int x_ = item.first;
                int y_ = item.second;
                if(can_visit(x_, y_)){
                    visited[x_][y_] = true;
                    Q.push(make_pair(x_, y_));
                }
            }
        }
    }

    printf("%d\n", count);

    return true;
}

int main(void){
    while(exec()){
        ;
    }
    
    return 0;
}