Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var route [][]int

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func dfs(h, w int) {
	if route[h][w] == 0 {
		return
	}

	route[h][w] = 0
	for _, x := range []int{-1, 0, 1} {
		for _, y := range []int{-1, 0, 1} {
			if route[h+x][w+y] == 0 {
				continue
			}
			dfs(h+x, w+y)
		}
	}
}

func main() {
	writer := bufio.NewWriter(os.Stdout)
	for {
		w, h := scanInt(), scanInt()
		if w == 0 && h == 0 {
			break
		}

		route = make([][]int, h+2)
		route[0] = make([]int, w+2)
		for i := 1; i <= h; i++ {
			route[i] = make([]int, w+2)
			for j := 1; j <= w; j++ {
				route[i][j] = scanInt()
			}
		}
		route[h+1] = make([]int, w+2)

		total := 0
		for i := 1; i <= h; i++ {
			for j := 1; j <= w; j++ {
				if route[i][j] == 1 {
					total++
					dfs(i, j)
				}
			}
		}
		fmt.Fprintln(writer, total)
	}
	writer.Flush()
}

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

using namespace std;

typedef long long ll;

template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void solve(int cur_x, int cur_y, vector<vector<bool>> &visited,
        const int H, const int W, const vector<vector<int>> &field) {
    visited[cur_y][cur_x] = true;

    vector<pair<int, int>> diff_xy = {
        {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}
    };
    for (int i = 0; i < (int) diff_xy.size(); i++) {
        int next_x = cur_x + diff_xy[i].first;
        int next_y = cur_y + diff_xy[i].second;
        if (next_x < 0 || next_x >= W || next_y < 0 || next_y >= H) continue;
        if (visited[next_y][next_x]) continue;
        if (field[next_y][next_x] == 0) continue;
        solve(next_x, next_y, visited, H, W, field);
    }
}

int main(void) {
    while (1) {
        int w, h;
        cin >> w >> h;

        if (w == 0 && h == 0) break;

        vector<vector<int>> field(h, vector<int>(w));
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> field[i][j];
            }
        }

        vector<vector<bool>> visited(h, vector<bool>(w, false));
        int count = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (visited[i][j]) continue;
                if (field[i][j] == 0) continue;
                solve(j, i, visited, h, w, field);
                count++;
            }
        }

        cout << count << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a,int b){return b?GCD(b,a%b):a;}
int LCM(int a,int b){return (a*b)/GCD(a,b);}
int abs(int x){return x>0?x:-x;}
 
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int sea[50][50];
int w, h;
void dfs(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 (0 <= nx and nx < h and 0 <= ny and ny < w and sea[nx][ny] == 1){
			dfs(nx, ny);
		}
	}

	return;
}

int main()
{
	while (1){
		int ans = 0;
		cin >> w >> h;
		if (!w and !h) return 0;
		REP(i, h){
			REP(j, w){
				cin >> sea[i][j];
			}
		}

		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				if (sea[i][j] == 1){
					dfs(i, j);
					ans++;
				}
			}
		}

		cout << ans << endl;
	}

}

C++: #include <cstdio>

int w, h, c[50][50], count = 0;

void search(int x, int y)
{
    c[y][x] = 0;

    for (int dx = -1; dx <= 1; ++dx)
    {
        for (int dy = -1; dy <= 1; ++dy)
        {
            if (x + dx < 0 || x + dx >= w || y + dy < 0 || y + dy >= h)
            {
                continue;
            }

            if (c[y + dy][x + dx] == 1)
            {
                search(x + dx, y + dy);
            }
        }
    }
}

bool sub_search()
{
    for (int i = 0; i < h; ++i)
    {
        for (int j = 0; j < w; ++j)
        {
            if (c[i][j] == 1)
            {
                search(j, i);
                count++;
                return true;
            }
        }
    }

    return false;
}

int main()
{
    while (true)
    {
        scanf("%d %d", &w, &h);
        if (w == 0 && h == 0)
        {
            break;
        }

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

        count = 0;

        while (sub_search())
        {
        }

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

C++: #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<pair<int, int>> directions = {
    {1,0}, {0,1}, {-1,0}, {0,-1}, {1,1}, {1,-1}, {-1,1}, {-1,-1}
};
void dfs(Graph &chart, int x, int y) {
    int H = chart.size(), W = chart[0].size();
    chart[x][y] = -1;
    for (int i = 0; i < directions.size(); i++) {
        int nx = x + directions[i].first;
        int ny = y + directions[i].second;
        if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;
        if (chart[nx][ny] == 1) dfs(chart, nx, ny);
    }
}

int main() {
    while (true) {
        int H, W;
        cin >> W >> H;
        if (H == 0 && W == 0) break;
        Graph chart(H, vector<int>(W));
        for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
            cin >> chart[i][j];
        }
        int cnt = 0;
        for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
            if (chart[i][j] == 1) {
                dfs(chart, i, j);
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}

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

int w,h;
int c[50][50];
vector<vector<int> > visited;
int dx[]={1,1,0,-1,-1,-1,0,1};
int dy[]={0,-1,-1,-1,0,1,1,1};

bool dfs(int x,int y){
    if(visited[x][y]) return false;
    visited[x][y]=1;

    for(int d=0;d<8;d++){
        int i=x+dx[d];
        int j=y+dy[d];
        if(0<=i&&i<h&&0<=j&&j<w){
            if(c[i][j]){
                dfs(i,j);
            }  
        }
    }
    return true;
}

int solve(int w,int h){

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

int main(){
    visited.assign(50,vector<int>(50,0));
    while(1){
        cin>>w>>h;
        if(!(w))break;

        solve(w,h);
    }
    
    return 0;
}

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

using namespace std;

int c[64][64];

void paint(int y, int x) {
  if (y < 0 || y >= 50 || x < 0 || x >= 50) return;
  if (c[y][x] == 0) return;
  c[y][x] = 0;
  for (int dy = -1; dy <= 1; ++dy) {
    for (int dx = -1; dx <= 1; ++dx) {
      paint(y + dy, x + dx);
    }
  }
}

int main() {
  int H, W;
  while (cin >> W >> H, H) {
    for (int i = 0; i < H; ++i) {
      for (int j = 0; j < W; ++j) {
        cin >> c[i][j];
      }
    }
    int res = 0;
    for (int y = 0; y < H; ++y) {
      for (int x = 0; x < W; ++x) {
        if (c[y][x] == 1) {
          ++res;
          paint(y, x);
        }
      }
    }
    cout << res << endl;
  }
  return 0;
}