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
}

C++: #include <iostream>
#include <queue>
#include <algorithm>
#include <cstring>

using namespace std;

namespace {
    const int MAX_W = 50;
    const int MAX_H = 50;
    int W, H;
    int F[MAX_H][MAX_W];
    bool input() {
        cin >> W >> H;
        if (W == 0 && H == 0) return false;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                cin >> F[i][j];
            }
        }
        return true;
    }

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

    void solve() {
        bool used[H][W];
        memset(used, 0, sizeof(used));
        int ans = 0;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (F[i][j] == 0) continue;
                if (used[i][j]) continue;
                typedef pair<int, int> P;
                queue<P> Q;
                Q.push(P(i, j));
                ans++;
                used[i][j] = true;
                while (!Q.empty()) {
                    P c = Q.front(); Q.pop();
                    int y = c.first, x = c.second;
                    for (int k = 0; k < 8; k++) {
                        int ny = y + dy[k];
                        int nx = x + dx[k];
                        if (ny < 0 || ny >= H) continue;
                        if (nx < 0 || nx >= W) continue;
                        if (F[ny][nx] == 0) continue;
                        if (used[ny][nx]) continue;
                        used[ny][nx] = true;
                        Q.push(P(ny, nx));
                    }
                }
            }
        }
        cout << ans << endl;
    }
}

int main() {
    while (input()) solve();
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>

using namespace std;
#define ll long long
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
const ll mod = 1e9 + 7;


int w;
int h;
vector<vector<int> > c(50, vector<int>(50));
vector<vector<bool> > reached(50, vector<bool>(50,false));

void dfs(int y, int x){
    reached.at(y).at(x) = true;

    for(int dy = -1; dy <= 1; dy++){
        for(int dx = -1; dx <= 1; dx++){
            int nx = x + dx;
            int ny = y + dy;
			if(ny < 0 || h <= ny || nx < 0 || w <= nx || c.at(ny).at(nx) == 0) continue;          
            if(reached.at(ny).at(nx)) continue;
            dfs(ny,nx);

       }
    }
    
}




int main (){
while(cin>>w>>h,w!=0&&h!=0){
	
  	
    REP(i,h){//y
        REP(j,w){//x
          	reached.at(i).at(j) = false;
            cin >> c.at(i).at(j);
        }
    }
    int ans = 0;
    REP(i,h){
        REP(j,w){
            if(!reached.at(i).at(j) && c.at(i).at(j) == 1){
                dfs(i,j);
                ans++;
            }
            
        }
    }

    cout << ans << endl;




}

    return 0;
}

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

int c[100][100],ans;

int search(int x, int y){
	if(c[x][y] == 1){
		c[x][y] = 2;
		search(x-1, y-1);
		search(x-1, y);
		search(x-1, y+1);
		search(x, y-1);
		search(x, y+1);
		search(x+1, y-1);
		search(x+1, y);
		search(x+1, y+1);
	return 1;	
	}
	else return 0;
}

int main(){
	int w,h,i,j;
	while(cin >> w >> h && w > 0 && h >0){
		for(i = 1; i <= 99; i++){
			for(j = 1; j <= 99; j++){
				c[i][j] = 0;
			}
		}
		ans = 0;
		for(i = 1; i <= h; i++){
			for(j = 1; j <= w; j++){
				cin >> c[i][j];
			}
		}
		for(i = 1; i <= h; i++){
			for(j = 1; j <= w; j++){
				if(search(i, j) == 1){
					ans++;
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0 ; i < n ; ++i)

using namespace std;

#ifdef _DEBUG
#define debug_io fstream cin("input.txt");ofstream cout("output.txt");
#else
#define debug_io ;
#endif

int main()
{
	debug_io
	int w, h;
	while (cin >> w >> h, w + h) {
		int tile[55][55];
		REP(i, h) {
			REP(j, w) {
				cin >> tile[i][j];
			}
		}

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

		int ans = 0;
		REP(i, h) {
			REP(j, w) {
				if (tile[i][j] == 1) {
					vector<pair<int, int>> bfs;
					bfs.push_back({ i,j });

					while (bfs.size()) {
						auto now = bfs.front();
						bfs.erase(bfs.begin());
						int x = now.second;
						int y = now.first;
						if (tile[y][x] == 2) {
							continue;
						}
						tile[y][x] = 2;
						REP(k, 8) {
							int nx = max(0,min(x + dx[k],w-1));
							int ny = max(0, min(y + dy[k], h - 1));
							if (tile[ny][nx] == 1) {
								bfs.push_back({ ny,nx });
							}
						}
					}
					ans++;
					
				}
			}
		}
		cout << ans << endl;
	}
}