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
}

Python: import sys

sys.setrecursionlimit(10**5)

def solve():
    while 1:
        w, h = map(int, sys.stdin.readline().split())

        if w == h == 0:
            return

        room = [[int(j) for j in sys.stdin.readline().split()] for i in range(h)]

        cnt = 0

        for i in range(h):
            for j in range(w):
                if room[i][j]:
                    cnt += 1
                    dfs(w, h, room, i, j)

        print(cnt)

def dfs(w, h, room, i, j):
    if i < 0 or i >= h or j < 0 or j >= w or (not room[i][j]):
        return

    room[i][j] = 0

    dfs(w, h, room, i + 1, j)
    dfs(w, h, room, i - 1, j)
    dfs(w, h, room, i, j + 1)
    dfs(w, h, room, i, j - 1)
    dfs(w, h, room, i + 1, j + 1)
    dfs(w, h, room, i + 1, j - 1)
    dfs(w, h, room, i - 1, j + 1)
    dfs(w, h, room, i - 1, j - 1)

if __name__ == '__main__':
    solve()

C++: #include <bits/stdc++.h>
using namespace std;
int ans = 1e9;
int H,W;
int mp[50][50];
int nx,ny;
void func(int y,int x){
	//cout << y << ' ' <<x<<endl;
	if(mp[y][x] == 1){
		mp[y][x] = 2;
		func(y,x);
	}
	if(mp[y+1][x] == 1){
		mp[y+1][x] = 2;
		func(y+1,x);
	}
	if(mp[y][x+1] == 1){
		mp[y][x+1] = 2;
		func(y,x+1);
	}
	if(mp[y+1][x+1] == 1){
		mp[y+1][x+1] = 2;
		func(y+1,x+1);
	}
	if(mp[y-1][x] == 1){
		mp[y-1][x] = 2;
		func(y-1,x);
	}
	if(mp[y][x-1] == 1){
		mp[y][x-1] = 2;
		func(y,x-1);
	}
	if(mp[y-1][x-1] == 1){
		mp[y-1][x-1] = 2;
		func(y-1,x-1);
	}
	if(mp[y+1][x-1] == 1){
		mp[y+1][x-1] = 2;
		func(y+1,x-1);
	}
	if(mp[y-1][x+1] == 1){
		mp[y-1][x+1] = 2;
		func(y-1,x+1);
	}
}
void findL(){
	nx = -1;ny = -1;
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if(mp[i][j] == 1){
				nx = j,ny = i;
				//cout <<nx<<ny<<endl;
				i = H; j = W;
			}
		}
	}
}
int main(){
	
	cin >> H>>W;
	while(W!=0){
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				cin >> mp[i][j];
			}
		}
		int c = 0;
		findL();
		while(nx != -1 && ny != -1){
			func(ny,nx);
			c++;
			findL();
		}
		cout << c << endl;
		cin >> W >> H;
	}
	return 0;
}

C++: #include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <memory.h>
#include <functional>

using namespace std;

//FILE * in = freopen("B", "r", stdin);

typedef pair<int,int> P;

int n, m;
int cnt = 0;
int data[100][100];
int check[100][100];

int mvx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int mvy[] = {-1, -1, -1, 0, 0, 1, 1, 1};

void input() {
	for(int i = 0; i < m; i++){
		for(int j = 0; j < n; j++) {
			scanf("%d", &data[i][j]);
		}
	}
	cnt = 0;
	memset(check, 0, sizeof(check));
}

void bfs(int x, int y) {
	queue<P> que;
	que.push(P(x,y));
	check[x][y] = 1;
	while(!que.empty()){
		P cur = que.front(); que.pop();
		for(int i = 0; i < 8; i++) {
			if(cur.first + mvx[i] >= 0 && cur.first + mvx[i] < n && cur.second + mvy[i] >= 0 && cur.second + mvy[i] < m
				&& data[cur.first + mvx[i]][cur.second + mvy[i]] && !check[cur.first+mvx[i]][cur.second+mvy[i]]){
					check[cur.first +mvx[i]][cur.second+mvy[i]] = 1;
					que.push(P(cur.first+mvx[i], cur.second+mvy[i]));
			}
		}
	}
}

void process() {
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			if(data[i][j] && !check[i][j]) {
				bfs(i,j);
				++cnt;
			}
		}
	}
	printf("%d\n", cnt);
}

int main() {
	while(true) {
		scanf("%d%d", &n, &m);
		if(n == 0) break;
		input();
		process();
	}
	return 0;
}

C++: #include<cstdio>
#include<utility>
#include<algorithm>
#include<set>
using namespace std;

int w,h;
pair<int,int> g[50][50];
int s[50][51];

void dfs(int x,int y,int xx,int yy){
    g[x][y]=make_pair(xx,yy);
    for(int i=max(0,x-1);i<min(x+2,h);i++){
        for(int j=max(0,y-1);j<min(y+2,w);j++){
            if(s[i][j]&&(g[i][j].first!=xx||g[i][j].second!=yy)){
                dfs(i,j,xx,yy);
            }
        }
    }
}

int main(){
    scanf("%d%d",&w,&h);
    while(w&&h){
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                scanf("%d",&s[i][j]);
            }
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                g[i][j]=make_pair(i,j);
            }
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(s[i][j]==1&&g[i][j].first==i&&g[i][j].second==j){
                    dfs(i,j,i,j);
                }
            }
        }
        set<pair<int,int> > se;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(s[i][j]==1){
                    se.insert(g[i][j]);
                }
            }
        }
        printf("%ld\n",se.size());
        scanf("%d %d",&w,&h);
    }
}

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

int c[51][51];
void dfs(int x,int y){
  int i,j;
  c[x][y]=0;
  for(i=-1;i<=1;++i){
    for(j=-1;j<=1;++j){
      if(c[x+i][y+j]==1){
	dfs(x+i,y+j);
      }
    }
  }
}

int main(){
  int w,h;
  int i,j;

  while(1){
    cin >>w >>h;
    if(w==0 && h==0) break;
    int cnt=0;
    for(i=0;i<h;++i){
      for(j=0;j<w;++j)
	cin >>c[i][j];
    }
    for(i=0;i<h;++i){
      for(j=0;j<w;++j){
	if(c[i][j]==1){
	  dfs(i,j);
	  cnt++;
	}
      }
    }
    cout << cnt << endl;
  }
  return 0;
}