Go: package main

import (
	"fmt"
)

func main() {
	var h, w int
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			return
		}
		matrix := make([][]int, h)
		Sean := make([][]bool, h)
		for i := 0; i < h; i++ {
			matrix[i] = make([]int, w)
			Sean[i] = make([]bool, w)
			for j := 0; j < w; j++ {
				fmt.Scan(&matrix[i][j])
			}
		}
		var count int
		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				if matrix[i][j] == 1 && Sean[i][j] == false {
					search(i, j, h, w, matrix, Sean)
					count++
				}
			}
		}
		fmt.Println(count)
	}
}
func search(x int, y int, h int, w int, matrix [][]int, Sean [][]bool) {
	if x < 0 || y < 0 || x >= h || y >= w || matrix[x][y] == 0 {
		return
	}
	if Sean[x][y] == true {
		return
	}

	Sean[x][y] = true

	search(x+1, y, h, w, matrix, Sean)
	search(x-1, y, h, w, matrix, Sean)
	search(x, y+1, h, w, matrix, Sean)
	search(x, y-1, h, w, matrix, Sean)
	search(x+1, y-1, h, w, matrix, Sean)
	search(x-1, y+1, h, w, matrix, Sean)
	search(x+1, y+1, h, w, matrix, Sean)
	search(x-1, y-1, h, w, matrix, Sean)
}

C++: #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef long long ll;

int field[64][64];
bool done[64][64];
int w, h;

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

void dfs(int y, int x) {
    done[y][x] = true;
    for (int i = 0; i < 8; i++) {
        int ny = y + dy[i];
        int nx = x + dx[i];
        if (0 <= nx && nx < w && 0 <= ny && ny < h && field[ny][nx] == 1 && done[ny][nx] == false) {
            dfs(ny, nx);
        }
    }
}

int main(void) {
    while (1) {
        cin >> w >> h;
        if (w == 0 && h == 0) break;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> field[i][j];
                done[i][j] = false;
            }
        }
        int ans = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (field[i][j] == 1 && done[i][j] == false) {
                    dfs(i, j);
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

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

using namespace std;

bool check(bool[50][50],pair<int, int>);
void rmv(bool[50][50], int, int);

int main(){
	for(int w, h; cin >> w >> h, w||h;){
		bool fld[50][50] = {0};
		int n;

		for(int i = 0; i < h; i++)
			for(int j = 0; j < w; j++)
				cin >> fld[i][j];

		for(n = 0; check(fld,make_pair(w, h)); n++);
		cout << n << endl;
	}
	return 0;
}


bool check(bool fld[50][50],pair<int, int> wide){
	for(int i = 0; i < wide.second; i++)
		for(int j = 0; j < wide.first; j++)
			if(fld[i][j]){
				rmv(fld, i, j);
				return true;
			}
	return false;
}

void rmv(bool fld[50][50], int y, int x){
	if(x >= 0 && y >= 0 && x <= 50 && y <= 50)
	if(fld[y][x]){
		fld[y][x] = false;
		for(int i = -1; i <= 1; i++)
			for(int j = -1; j <= 1; j++)
				rmv(fld, y+i , x+j);
	}
}

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

int w,h;
int mp[50][50];

void rec(int y,int x){
	if(mp[y][x]==0)return;
	mp[y][x]=0;
	if(x+1<w)rec(y,x+1);
	if(y+1<h)rec(y+1,x);
	if(x-1>=0)rec(y,x-1);
	if(y-1>=0)rec(y-1,x);
	if(x+1<w&&y-1>=0)rec(y-1,x+1);
	if(x+1<w&&y+1<h)rec(y+1,x+1);
	if(x-1>=0&&y+1<h)rec(y+1,x-1);
	if(y-1>=0&&x-1>=0)rec(y-1,x-1);
}

int main(){
	int x,y,ret;
	while(cin >> w >> h && w && h){
		ret = 0;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin >> mp[i][j];
			}
		}
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(mp[i][j]){
					rec(i,j);
					ret++;
				}
			}
		}
		cout << ret << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;
using ll = long long;

int w, h;
vector<vector<bool>> mp;


vector<pair<int,int>> dir{{0,1},{1,0},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};

void dfs(int y, int x)
{
    for(auto i : dir){
        if(mp[y + i.first][x + i.second]){
            mp[y + i.first][x + i.second] = false;
            dfs(y + i.first, x + i.second);
        }
    }
}


int main()
{
    vector<int> AS;
    while(1){
        cin >> w >> h;
        if(!w && !h)break;
        mp.resize(h + 2,vector<bool>(w + 2));
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                int t; cin >> t;
                mp[i][j] = t;
            }
        }

        int ans = 0;
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                if(mp[i][j]){
                    mp[i][j] = false;
                    dfs(i, j);
                    ans++;
                }
            }
        }
        AS.push_back(ans);
    }
    for(auto i : AS)cout << i << endl;
}

C++: #include<cmath>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdio>
#include<map>
#include<utility>
#include<list>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int dX[8] = { 0, 1, 1, 1, 0, -1, -1, -1 }, dY[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
struct XY
{
	int x;
	int y;
};


/*
(char)'1' - (int)48 = (int)1;


*/
int main()
{
	int h, w;
	cin >> w>> h;
	while (w != 0 || h != 0)
	{
		queue<XY> m;
		int a[200][200] = {};
		for (int i = 0; i < h; i++)
		{
			for (int l = 0; l < w; l++)
			{
				cin >> a[i + 1][l + 1];
			}
		}


		int ans = 0;

		for (int i = 0; i <= h; i++)
		{
			for (int l = 0; l <= w; l++)
			{
				if (a[i][l] == 1)
				{
					ans++;
					XY now;
					now.x = l;
					now.y = i;
					m.push(now);
					while (!m.empty())
					{
						XY gg;
						int x, y;
						x = m.front().x;
						y = m.front().y;
						m.pop();

						for (int i = 0; i < 8; i++)
						{
							if (a[y + dY[i]][x + dX[i]] == 1)
							{
								a[y + dY[i]][x + dX[i]] = 0;
								gg.x = x + dX[i];
								gg.y = y + dY[i];
								m.push(gg);
							}
						}

					}
				}
			}
		}
		cout << ans << endl;
		cin >> w >> h;
	}
}

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

int w, h;
int dy[8]={0,1,1,1,0,-1,-1,-1}, dx[8]={-1,-1,0,1,1,1,0,-1};
char sea[50][50];

void f(int x, int y){
	sea[x][y] = '0';
	for(int i = 0;i < 8;i++){
		int nx = x + dx[i], ny = y + dy[i];
		if(nx>=0 and nx<h and ny>=0 and ny<w and sea[nx][ny]=='1'){
			// cout << nx << " " << ny << endl;
			f(nx, ny);
		}
	}
	return;
}

int main(){
	while(1){
		cin >> w >> h;
		if(w == 0 and h == 0) break;
		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j) cin >> sea[i][j];
		}

		int ans = 0;

		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j){
				if(sea[i][j] == '1'){
					// cout << i << j << endl;
					ans++;
					f(i, j);
				}
			}
		}

		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int m[50][50]={};
int w,h;
int cnt;

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

void fanc(int y,int x){
	m[y][x]=0;
	int ny,nx;
	for(int i=0;i<8;i++){
		ny = y+dy[i];
		nx = x+dx[i];
		if(ny>=0&&nx>=0&&ny<h&&nx<w&&m[ny][nx]==1){
			fanc(ny,nx);
		}
	}
}

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