Go: package main

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

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), math.MaxInt32)
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		return []byte(f1())
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func gcd64(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return gcd64(b, a%b)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	for {
		ans, ok := solve()
		if !ok {
			break
		}
		println(ans)
	}

}

func solve() (int, bool) {
	w := readInt()
	h := readInt()
	if w == 0 && h == 0 {
		return 0, false
	}

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

	var ans int
	for i := 1; i-1 < h; i++ {
		for j := 1; j-1 < w; j++ {
			if 0 < c[i][j] {
				ans++
				dfs(c, i, j)
			}
		}
	}
	return ans, true
}

func dfs(c [][]int, y, x int) {
	c[y][x] = 0
	dx := []int{-1, 0, 1, -1, 1, -1, 0, 1}
	dy := []int{-1, -1, -1, 0, 0, 1, 1, 1}
	for i := range dx {
		nx := x + dx[i]
		ny := y + dy[i]
		if 0 < c[ny][nx] {
			dfs(c, ny, nx)
		}
	}
}

// -----------------------------------------------------------------------------

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

using namespace std;

pair<int, int> serch_land(vector<vector<int> >& maps){
  for(int i = 0; i < maps.size(); i++){
    for(int j = 0; j < maps[i].size(); j++){
      if(maps[i][j] == 1){
        return make_pair(i, j);
      }
    }
  }
  return make_pair(-1, -1);
}

void delete_land(vector<vector<int> >& maps, pair<int, int> start){
  int dh[8] = {1, 1, 1, 0, 0, -1, -1, -1};
  int dw[8] = {1, 0, -1, 1, -1, 1, -1, 0};

  stack< pair<int, int> > s;
  s.push(start);
  pair<int, int> cur;
  maps[start.first][start.second] = 0;

  while(!s.empty()){
    cur = s.top();
    s.pop();

    for(int i = 0; i < 8; i++){
      if(maps[cur.first + dh[i]][cur.second + dw[i]] == 1){
        maps[cur.first + dh[i]][cur.second + dw[i]] = 0;
        pair<int, int> next = make_pair(cur.first + dh[i], cur.second + dw[i]);
        s.push(next);
      }
    }
  }
}

int main(){
  int w, h;

  while(cin >> w >> h, !(w == 0 && h == 0)){
    vector<vector<int> > maps = vector<vector<int> >(h+2, vector<int>(w+2));
    pair<int, int> land;

    for(int i = 0; i < h+2; i++){
      for(int j = 0; j < w+2; j++){
        if(i == 0 || j == 0 || i == h+1 || j == w+1){
          maps[i][j] = 0;
        }else{
          cin >> maps[i][j];
        }
      }
    }


    int cnt = 0;
    while(land = serch_land(maps), land.first != -1){
      cnt++;
      delete_land(maps, land);
    }
    cout << cnt << endl;

  }
}

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

typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8  fixed<<setprecision(8) 
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

using namespace std;
int f[64][64];

int del(int i,int j)
{
  if(i<0||j<0) return 0;
  if(f[i][j]){
    f[i][j]=0;
    REP(di,3) REP(dj,3)
      del(i+di-1,j+dj-1);
    return 1;
  }
  else return 0;
}
int main(void)
{
  for(;;){
    int n,m;
    cin >> n >> m;
    if(!n&&!m) return 0;
    REP(j,m){
      REP(i,n)
	cin >> f[i][j];
    }
    int answer=0;
    REP(j,m){
      REP(i,n)
	answer+=del(i,j);
    }
    cout << answer << endl;
  }
}

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

int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}, dy[] = {1, -1, 0, 0, 1, -1, -1, 1}, W, H;
bool mem[50][50];

int bfs(int sx, int sy)
{
  if(!mem[sy][sx])
    return 0;
  queue<int> q;
  q.push(sx);
  q.push(sy);
  while(!q.empty())
  {
    int x = q.front(); q.pop();
    int y = q.front(); q.pop();
    mem[y][x] = 0;
    for(int i = 0; i < 8; i++)
    {
      int tx = x + dx[i];
      int ty = y + dy[i];
      if(tx >= 0 && tx < W && ty >= 0 && ty < H && mem[ty][tx])
      {
        q.push(tx);
        q.push(ty);
      }
    }
  }
  return 1;
}

int main()
{
loop:
  int ans = 0;
  for(int y = 0; y < 50; y++)
    for(int x = 0; x < 50; x++)
      mem[y][x] = 0;
  cin >> W >> H;
  if(!W)
    return 0;
  for(int y = 0; y < H; y++)
    for(int x = 0; x < W; x++)
      cin >> mem[y][x];
  for(int y = 0; y < H; y++)
    for(int x = 0; x < W; x++)
      ans += bfs(x, y);
  cout << ans << endl;
  goto loop;
}

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

int H,W;
vector<vector<int> >field;

void dfs(int h, int w)
{
    field[h][w] = 0;
    
    for(int dh = -1; dh <= 1; dh++)
    {
        for(int dw = -1; dw <= 1; dw++)
        {
            int nh = h + dh;
            int nw = w + dw;
            
            if((nh >= H)||(nh < 0)||(nw >= W)||(nw < 0)) continue;
            if(field[nh][nw] == 0) continue;
            
            dfs(nh,nw);
        }
    }
}



int main()
{
    while(cin >> W >> H)
    {
        if((W == 0)||(H == 0)) break;
        field.assign(H,vector<int>(W,0));
        for(int h = 0; h < H; h++)
        {
            for(int w = 0; w < W; w++)
            {
                cin >> field[h][w];
            }
        }
        
        int count = 0;
        for(int h = 0; h < H; h++)
        {
            for(int w = 0; w < W; w++)
            {
                if(field[h][w] == 0) continue;
                dfs(h,w);
                count++;
            }
        }
        cout << count << endl;
    }
}