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 <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <vector>

#define FOR(i,k,n) for(int (i) = (k); (i) < (n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x,y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
template<class T> using vv=vector< vector<T> >;
typedef deque<int> di;
typedef deque< deque<int> > ddi;

int dx[3] = {-1,0,1}, dy[3] = {-1,0,1};

int c[55][55] = {};

void dfs(i_i p) {
    c[p.first][p.second] = 0;
    rep(i,3) {
        rep(j,3) {
            if(c[p.first+dx[i]][p.second+dy[j]] == 1) {
                dfs(make_pair(p.first+dx[i], p.second+dy[j]));
            }
        }
    }
}

int main() {
    int w,h;
    while(cin >> w >> h,w) {
        memset(c,0,sizeof(c));
        FOR(i,1,h+1) {
            FOR(j,1,w+1) {
                cin >> c[i][j];
            }
        }
        int sum = 0;
        FOR(i,1,h+1) {
            FOR(j,1,w+1) {
                if(c[i][j] == 1) {
                    dfs(make_pair(i,j));
                    sum += 1;
                }
            }
        }
        cout << sum << endl;
    }
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int H,W;
void dfs(int h,int w,vector<vector<int> > &table){
    //cout << h << " " << w << endl;
    table[h][w] = 0;
    int dx[] = {-1,-1,-1,0 ,0,1 ,1,1};
    int dy[] = {-1,0 ,1 ,-1,1,-1,0,1};
    rep(i,0,8){
        int nx = w + dx[i];
        int ny = h + dy[i];
        if (nx >= W || nx < 0 || ny >= H || ny < 0) continue;
        if(table[ny][nx])dfs(ny,nx,table);
    }
}
main(){
    cin >> W >> H;
    vector< vector<int> > table;
    while(W){
        table = vector< vector<int> > (H,vector<int>(W) );
        rep(i,0,H)rep(j,0,W)cin >> table[i][j];
        rep(i,0,H)rep(j,0,W)cout << table[i][j] << " \n"[j==W-1];
        int cnt = 0;
        rep(i,0,H)rep(j,0,W){
            if(table[i][j] == 1){
                //cout << i << " " << j << endl;
                dfs(i,j,table);
                cnt++;
            }
        }
        cout << cnt << endl;
        cin >> H >> W;
    }
}

C++: #include <cstdio>
#include <iostream>
 
using namespace std;
 
int main(void){
    
    while(1){
        
        int w, h;
        
        cin >> w >> h;
        if(w == 0 && h == 0) break;
        
        int map[52][52] = { {0} };
        int check[52][52] = { {0} };
        
        int i, j;
        for(j=1; j<=h; j++){
            for(i=1; i<=w; i++){
                cin >> map[j][i];
            }
        }
        
        
        int label = 1;
        
        int x, y;
        for(y=1; y<=h; y++){
            for(x=1; x<=w; x++){
                if(map[y][x] == 1){
                    if(check[y][x-1] || check[y-1][x-1] || check[y-1][x] || check[y-1][x+1]){
                        int min;
                        if(check[y][x-1]){
                            min = check[y][x-1];
                        } else {
                            min = 2500;
                        }
                        for(int k=x-1; k<=x+1; k++){
                            if(check[y-1][k] != 0 && check[y-1][k] < min) min = check[y-1][k];
                        }
                        check[y][x] = min;
                    } else {
                        check[y][x] = label;
                        label++;
                    }
                }
            }
        }
        
        
        for(y=h; y>0; y--){
            for(x=w; x>0; x--){
                if(check[y][x]){
                    int min = check[y][x];
                    for(int n=y-1; n<=y+1; n++){
                        for(int k=x-1; k<=x+1; k++){
                            if(check[n][k] != 0 && check[n][k] < min) min = check[n][k];
                        }
                    }
                    check[y][x] = min;
                }
            }
        }
        
        int count = 0;
        
        for(y=1; y<=h; y++){
            for(x=1; x<=w; x++){
                if(count < check[y][x]) count = check[y][x];
            }
        }
        
        cout << count << endl;
        
    }
    
    
    return 0;
}