Go: ///
// File:  1160.go
// Author: ymiyamoto
//
// Created on Sun Mar  4 20:45:57 2018
//
package main

import (
	"fmt"
)

var w, h int
var graph [][]string

func dfs(visited [][]bool, x, y int) {
	visited[x][y] = true

	for i := -1; i <= 1; i++ {
		for j := -1; j <= 1; j++ {
			dx := x + i
			dy := y + j
			if 0 <= dx && dx < h && 0 <= dy && dy < w && graph[dx][dy] == "1" && !visited[dx][dy] {
				dfs(visited, dx, dy)
			}
		}
	}
}

func main() {
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			break
		}

		graph = make([][]string, h)
		for i := range graph {
			graph[i] = make([]string, w)
		}

		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				var s string
				fmt.Scan(&s)
				graph[i][j] = s
			}
		}

		visited := make([][]bool, h)
		for i := range visited {
			visited[i] = make([]bool, w)
		}

		count := 0
		for i := range graph {
			for j := range graph[i] {
				if graph[i][j] == "1" && !visited[i][j] {
					dfs(visited, i, j)
					count++
				}
			}
		}

		fmt.Println(count)
	}
}

C++: #define _GLIBCXX_DEBUG

#include"bits/stdc++.h"
using namespace std;

//loops
#define REP(i,n) for(int i=0;i<(ll)(n);i++)
#define REPD(i,n) for(int i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(int i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(int i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(int i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)

//bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1<<n); ++bit)
#define isOne(bit, i) bit & (1<<i)


//arrays
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define add push_back


#define remove_unique(v) v.erase(unique(ALL(v)), v.end())

//pair
#define fir first
#define sec second

//types
#define ll long long
#define vec vector
#define cord2d pair<int,int>
//UNCOMMENT WHEN NEEDED
//#define int ll

//input
template <class T> T get(){ T s; cin >> s; return(s);}
#define gi get<int>()
#define gs get<string>()

template <class T> vector<T> getv(int n) { vec<T> v(n); REP(i, n) cin >> v[i]; return v; }
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)

//output
void print(int a){ cout << a << endl; }
void print(long long a){ cout << a << endl; }
void print(string a){ cout << a << endl; }
void print(char a){ cout << a << endl; }
void print(double a){ cout << a << endl; }
void print(double a, int dig){ cout << std::setprecision(dig) << a << endl; }

template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

template <class T = int>
void print(vec<T> v){ cout << v << endl; }

template <class T = int>
void print2dVec(vec<vec<T>> v2d){for(vec<T> v: v2d) {print(v);}}

void YesNo1(bool i = true){ return print(i?"Yes":"No"); }
void YESNO2(bool i = true){ return print(i?"YES":"NO"); }

//debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") { cout << string("          ", nest) << before; print(var); }

//name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__

//bool lambdas
#define lamb(exp) [](auto i){return exp;}
#define isEven [](int i){return i % 2 == 0;}
#define isOdd [](int i){return i % 2 != 0;}

//constants
const ll INF = 1e18;
const int MOD = 10000007;

//maths
int factorial(int k){ int sum = 1; for (int i = 1; i <= k; ++i) { sum *= i; } return sum; }
int gcd(int a, int b) {
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

////////////////////

// 深さ優先探索

vec<vec<bool>> seen;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};

int w,h;

void dfs(vec<vec<int>> &grid, int x, int y) {
    //cout << "   dfs - " << x << y << endl;
    seen[y][x] = true;
    if (grid[y][x] == 0) return;

    REP(i, 8) {
        int newX = x + dx[i];
        int newY = y + dy[i];
        //cout << newX << newY << ", ";

        if (newX < 0 || newX >= w || newY < 0 || newY >= h) continue;
        if (seen[newY][newX]) continue;
        if (grid[newY][newX] == 0) {
            //seen[newY][newX] = true;
            continue;
        }
        dfs(grid, newX, newY);
    }
    //cout << endl;
}

void Main() {
    //code here
    vec<int> answers;
    while(true) {
        w = gi;
        h = gi;
        //print(w);
        //print(h);
        //print("gotgrid");
        if (w==0 && h==0) {
            //print("hoo");
            break;
        }

        vec<vec<int>> grid;
        seen = {};
        REP(i, h) {
            grid.add(gim(w));
            seen.add({});
            REP(j, w) {
                seen[i].add(false);
            }
        }
        //print(grid);
        int res = 0;
        REP(y, h) {
            REP(x, w) {
                //print(" checknext");
                if (grid[y][x] == 1 && seen[y][x] == false) {
                    //print("  gonewisland");
                    dfs(grid, x, y);
                    res += 1;
                }
            }
        }
        answers.add(res);
    }
    for(int ans: answers) {
        print(ans);
    }
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Main();
}

C++: #include <iostream>
#include <vector>

using namespace std;

int dh[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dw[] = {0, 1, 1, 1, 0, -1, -1, -1};

void dfs(int h, int w, int **c, int sh, int sw, int **seen, int t) {
    seen[sh][sw] = t;
    
    for (int i = 0; i < 8; i++) {
        int nh = sh + dh[i], nw = sw + dw[i];
        if (nh < 0 || h <= nh || nw < 0 || w <= nw || seen[nh][nw] != -1 || c[nh][nw] == 0)
            continue;
        
        dfs(h, w, c, nh, nw, seen, t);
    }
}

void solve(int h, int w) {
    int **c = new int*[h];
    int **seen = new int*[h];
    for (int i = 0; i < h; i++) {
        c[i] = new int[w];
        seen[i] = new int[w];
        for (int j = 0; j < w; j++) {
            cin >> c[i][j];
            seen[i][j] = -1;
        }
    }

    int ans = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (seen[i][j] == -1 && c[i][j] != 0) {
                dfs(h, w, c, i, j, seen, ans+1);
                ans++;
            }
        }
    }

    cout << ans << endl;
    
}

int main() {
    int h, w;
    while (1) {
        cin >> h >> w;
        if (h == 0 && w == 0)
            break;
        
        solve(w, h);
    }
    
    return 0;
}