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 <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>

int H,W;
int c[55][55];
vector<vector<int > > s(55,vector<int>(55));
bool seen[55][55];
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
void dfs(int y,int x,int a){
  if(x<0||W<=x||y<0||H<=y||c[y][x]==0){return;}
  if(seen[y][x]){return;}
  seen[y][x]=true;s[y][x]=a;
  for(int i=0;i<8;i++){
    dfs(y+dy[i],x+dx[i],a);
  }
}

int main() {
 while(cin>>W>>H){
  if(W==0&&H==0){return 0;}
 // vector<vector<int > > s(55,vector<int>(55));
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      s[i][j]=0;
    }
  }
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin>>c[i][j];
    }
  }
  for(int i=0;i<55;i++){
    for(int j=0;j<55;j++){
      seen[i][j]=false;
    }
  }
  int a=1;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(c[i][j]){dfs(i,j,a);a++;}
    }
  }
  set<int>k;k.insert(0);
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(s[i][j]){k.insert(s[i][j]);}
    }
  }
  cout<<k.size()-1<<endl;
 }
  return 0;
}

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

using namespace std;
vector< vector<int> > map( 51 ,vector<int>(51,0));
int h,w;

void serch_island(int x,int y){
  map[y][x] = 0;
  const int dirX[] = {1 ,0, -1,  0, 1 , 1 , -1, -1};
  const int dirY[] = {0 ,1,  0, -1, 1 ,-1 ,  1, -1};
    for(int dir = 0; dir < 8; dir++){
      int nx = x + dirX[dir];
      int ny = y + dirY[dir];
      /*
      for(int i = 0; i < h ; i++){
        for(int j = 0; j < w; j++){
          cout << map[i][j] ;
        }
        cout << endl;
      }
      cout << endl;//*/
      if(nx >= 0 && nx < w &&
         ny >= 0 && ny < h &&
         map[ny][nx] == 1){
        serch_island(nx,ny);
      }
    }
    return ;
}

void solve(){
  int island = 0;

  for(int i = 0; i < h ; i++){
    for(int j = 0; j < w; j++){
      if(map[i][j] == 1){
        island++;
        serch_island(j, i);
      }
    }
  }
  cout << island << endl;
  map.clear();
  return ;
}
int main(){
  while(true){
    cin >> w >> h;
    if(h + w == 0) break;
    for(int i = 0; i < h ; i++){
      for(int j = 0; j < w; j++){
        cin >> map[i][j];
      }
    }
    solve();
  }
  return 0;
}

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

struct mapst {
	int x, y;
};

int main() {
	int w, h, ans=0;
	int c[52][52]={{0}}, f[52][52]={{1}};
	int dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
	int dy[8] = {0, -1, -1, -1, 0, 1, 1, 1};
	queue<mapst> q;
	while(1) {
		cin >> w >> h;
		if(!w&&!h) break;
		ans = 0;
		for(int i=0; i<52; ++i) for(int j=0; j<52; ++j) {
			c[i][j] = 0;
			f[i][j] = 1;
		}
		for(int i=1; i<=h; ++i) for(int j=1; j<=w; ++j) {
			cin >> c[i][j];
			f[i][j] = 1-c[i][j];
		}
		for(int i=1; i<=h; ++i) for(int j=1; j<=w; ++j) {
			if(c[i][j]&&!f[i][j]) {
				mapst m, ms;
				m.x = j; m.y = i;
				q.push(m);
				ans++;
				while(!q.empty()) {
					m = q.front();
					q.pop();
					f[m.y][m.x] = 1;
					for(int k=0; k<8; k++) {
						int nx = m.x + dx[k], ny = m.y + dy[k];
						if(c[ny][nx]&&!f[ny][nx]) {
							ms.x = nx; ms.y = ny;
							q.push(ms);
						}
					}
				};
			}
		}
		cout << ans << endl;
	}
	return 0;
}

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

const int limit=55;
int grid[limit][limit];
int w, h;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

void dfs(int, int);

int main(){
  while(cin >> w >> h, w!=0 && h!=0){
    //グリッドに情報格納
    for(int i=0; i<h; i++){
      for(int j=0; j<w; j++) cin >> grid[i][j];
    }

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

  return 0;
}

void dfs(int y, int x){
  if(grid[y][x]==0) return;
  if(y<0 || y>=h || x<0 || x>=w) return;

  grid[y][x] = 0;

  for(int i=0; i<8; i++){
    int ny = y+dy[i], nx = x+dx[i];
    dfs(ny, nx);
  }
}

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

using namespace std;

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vec vector

int dp[55][55];

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

void dfs(int x, int y)
{
	if (!dp[x][y]) return;
	dp[x][y] = 0;
	rep(i, 8) dfs(x + dx[i], y + dy[i]);
}

int main(void)
{
	while(1) {
		int w, h;
		cin >> w >> h;
		if (!w) break;
		rep(i, h + 2) rep(j, w + 2) dp[i][j] = 0;
		rep(i, h) rep(j, w) {
			cin >> dp[i + 1][j + 1];
		}
		
		int ret = 0;
		rep(i, h) rep(j, w) {
			if (!dp[i + 1][j + 1]) continue;
			ret++;
			dfs(i + 1, j + 1);
		}
		cout << ret << endl;
	}
	return 0;

}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
// using ll = long long;
// using P = pair<int, int>;

int m[51][51];
bool check[51][51];

void dfs(int y, int x, int w, int h){
    if(x < 0 || y < 0 || y >= h || x >= w) return;
    if(m[y][x] == 1 && !check[y][x]){
        check[y][x] = true;
        // cout << "[" << y << "," << x << "]" << endl;
        for(int dx = -1; dx <= 1; ++dx){
            for(int dy = -1; dy <= 1; ++ dy){
                dfs(y + dy, x + dx, w, h);
            }
        }
    }
}

int main() {
    int w, h;
    cin >> w >> h;
    
    while(w != 0 && h != 0){
        int res = 0;
        rep(i, 51) rep(j, 51){
            m[i][j] = 0;
            check[i][j] = false;
        }
        rep(i, h) rep(j, w) cin >> m[i][j];
        
        rep(i, h) rep(j, w){
            if(m[i][j] == 1 && !check[i][j]){
                ++res;
                // cout << "start[" << i << "," << j << "]" << endl; 
                dfs(i, j, w, h);
            }   
        }
        
        cout << res << endl;
        cin >> w >> h;
    }
    
    return 0;
}