Go: package main

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

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

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

int MAP(vector<vector<int> > &m, int i, int j){
	int w = m[0].size();
	int h = m.size();

	if(!(0 <= i && i < h && 0 <= j && j < w)){
		return 0;
	}

	if(m[i][j] == 0){
		return 0;
	}
	else if(m[i][j] = 1){
		m[i][j] = 0;
		MAP(m, i - 1, j - 1);
		MAP(m, i, j - 1);
		MAP(m, i + 1, j - 1);
		MAP(m, i - 1, j);
		MAP(m, i + 1, j);
		MAP(m, i - 1, j + 1);
		MAP(m, i, j + 1);
		MAP(m, i + 1, j + 1);
	}
	return 1;
}

int main(){
	int w, h;

	while(true){
		int count = 0;
		cin >> w >> h;

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

		vector<vector<int> > map(h, vector<int>(w, 0));

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

		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				count += MAP(map, i , j);
			}
		}

		cout << count << endl;
	}
}

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

int land[50][50], flag[50][50];
int w, h;
int xroot[] = {0,0,1,1,1,-1,-1,-1};
int yroot[] = {1,-1,0,-1,1,0,1,-1};
int cnt = 1;


void dfs(int x, int y){


  if(land[y][x] != 1) return;
  land[y][x] = cnt;

  for(int i = 0; i < 8; i++){
    int nx = x + xroot[i], ny = y + yroot[i];
    if(ny >= h || nx >= w || ny < 0 || nx < 0) continue;
    // cout << nx << " " << ny << endl;
    dfs(nx,ny);
  }
}

int main(){

  while(cin >> w >> h && (w || h)){
    cnt = 1;
    memset(flag,0,sizeof(flag));

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



    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){ 
	if(land[i][j] == 1){
	  cnt++;
	  dfs(j,i);
	}
      }
    }
    cout << cnt - 1 << endl;

  }



  return 0;
}

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

#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long  INF=1e18;
long long mod=1e9+7;
int maze[55][55]={};
bool reached[55][55]={};
int dx[8]={0,1,0,-1,1,-1,1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
int w,h;
int islands;

void search(int nowy,int nowx,bool start){

    if(reached[nowy][nowx]||maze[nowy][nowx]==0)return;

    if(start)islands++;

    reached[nowy][nowx]=true;
    //cout<<nowy<<" "<<nowx<<" "<<endl;
    rep(i,8)
    {
        int nx=nowx+dx[i];
        int ny=nowy+dy[i];

        if(nx<1 || nx>w || ny<1 || ny>h||reached[ny][nx]|| !maze[ny][nx])continue;

        search(ny,nx,false);
    }
    //cout<<islands<<" end"<<endl;
    return;
}
int main(){
    

    while(1){
    
    cin>>w>>h;
    if(w==0 && h==0)break;
    //cout<<w<<" "<<h<<endl;
    islands=0;

    rep2(i,50)rep2(k,50){
        reached[i][k]=false;
        maze[i][k]=0;
    }
    rep2(i,h)rep2(k,w){
        int t;
        cin>>t;
        maze[i][k]=t;
    }

    rep2(i,h)rep2(k,w)search(i,k,true);

    cout<<islands<<endl;
    
    }
    return 0;

}
/*


*/

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

using namespace std;

int w, h;

vector<vector<int>> makearea(void) {
	vector<vector<int>> area(h);

	for(int i = 0; i < h; i++) {
		for(int j = 0; j < w; j++) {
			int tmp;
			cin >> tmp;
			area[i].push_back(tmp);
		}
	}
	
	/*for(auto i : area) {
		for(auto j : i) {
			cout << j << " ";
		}
		cout << endl;
	}*/

	return area;
}

void dfs(int y, int x, vector<vector<int>>& area, vector<vector<bool>>& checker) {
	if(x != w - 1) {
		if(area[y][x + 1] == 1 and checker[y][x + 1] == true) {
			checker[y][x + 1] = false;
			dfs(y, x + 1, area, checker);
		}
	}
	if(x != w - 1 and y != h - 1){
		if(area[y + 1][x + 1] == 1 and checker[y + 1][x + 1]) {
			checker[y + 1][x + 1] = false;
			dfs(y + 1, x + 1, area, checker);
		}
	}
	if(y != h - 1){
		if(area[y + 1][x] == 1 and checker[y + 1][x]) {
			checker[y + 1][x] = false;
			dfs(y + 1, x, area, checker);
		}
	}
	if(x != 0 and y != h - 1){
		if(area[y + 1][x - 1] == 1 and checker[y + 1][x - 1]) {
			checker[y + 1][x - 1] = false;
			dfs(y + 1, x - 1, area, checker);
		}
	}
	if(x != 0){
		if(area[y][x - 1] == 1 and checker[y][x - 1]) {
			checker[y][x - 1] = false;
			dfs(y, x - 1, area, checker);
		}
	}
	if(x != 0 and y != 0){
		if(area[y - 1][x - 1] == 1 and checker[y - 1][x - 1]) {
			checker[y - 1][x - 1] = false;
			dfs(y - 1, x - 1, area, checker);
		}
	}
	if(y != 0){
		if(area[y - 1][x] == 1 and checker[y - 1][x]) {
			checker[y - 1][x] = false;
			dfs(y - 1, x, area, checker);
		}
	}
	if(x != w - 1 and y != 0){
		if(area[y - 1][x + 1] == 1 and checker[y - 1][x + 1]) {
			checker[y - 1][x + 1] = false;
			dfs(y - 1, x + 1, area, checker);
		}
	}
}

int search(vector<vector<int>>& area) {
	int sum = 0;
	vector<vector<bool>> checker;
	checker = vector<vector<bool>>(area.size(), vector<bool>(area[0].size(), true));

	for(int i = 0; i < h; i++) {
		for(int j = 0; j < w; j ++) {
			if(area[i][j] == 1 and checker[i][j]) {
				checker[i][j] = false;
				dfs(i, j, area, checker);
				sum++;
			}
		}
	}
	return sum;
}

int main(void) {
	while(1) { 
		cin >> w >> h;
		if(w == 0 and h == 0) {
			break;
		}

		vector<vector<int>> area = makearea();
		int sum = search(area);

		cout << sum << endl;
	}
	return 0;
}

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

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

int main(void) {
	int w,h;
	while(cin >> w >> h && w && h) {
		vector< vector<int> > data(w+2,vector<int>(h+2,0));
		for (int i = 1; i <= h; ++i) {
			for (int j = 1; j <= w; ++j) {
				cin >> data[i][j];
			}
		}

		int nx,ny;
		int count = 0;
		queue<int> fx,fy;
		for (int i = 1; i <= h; ++i) {
			for (int j = 1; j <= w; ++j) {
				if (data[i][j] == 1) {
					nx = j;
					ny = i;
					data[i][j] = 0;
					fx.push(nx);
					fy.push(ny);
					++count;

					while (!fx.empty()) {
						nx = fx.front();
						ny = fy.front();
						fx.pop();
						fy.pop();
						for (int d = 0; d < 8; ++d) {
							if (data[ny+dy[d]][nx+dx[d]] == 1) {
								fx.push(nx+dx[d]);
								fy.push(ny+dy[d]);
								data[ny+dy[d]][nx+dx[d]] = 0;
							}
						}
					}
				}
			}
		}
		cout << count << endl;
	}
	return 0;
}