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 <vector>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

int c[52][52];

void er(int i,int j){
    c[i][j]--;
    if(c[i+1][j-1])
        er(i+1,j-1);
    else if(c[i][j+1])
        er(i,j+1);
    else if(c[i+1][j])
        er(i+1,j);
    else if(c[i+1][j+1])
        er(i+1,j+1);
    else if(c[i-1][j+1])
        er(i-1,j+1);
    else if(c[i-1][j])
        er(i-1,j);
    else if(c[i-1][j-1])
        er(i-1,j-1);
    else if(c[i][j-1])
        er(i,j-1);
}

int main(void){
    int w,h;
    int i,j;
    int a;
    while(true){
        cin >> w >> h;
        if(w == 0){
            break;
        }
        for(i = 0;i < 52;i++){
            for(j = 0;j < 52;j++){
                c[i][j] = 0;
            }
        }
        for(i = 1;i <= w;i++){
            for(j = 1;j <= h;j++){
                cin >> c[i][j];
            }
        }
        a = 0;
        for(i = 1;i <= w;i++){
            for(j = 1;j <= h;j++){
                if(c[i][j]){
                    er(i,j);
                    a++;
                }
            }
        }
        cout << a << endl;
    }
}

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

using visited = std::vector<std::vector<bool>>;
using marine_map = std::vector<std::vector<int>>;

int dx[] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy[] = {1, 1, 1, 0, 0, -1, -1, -1};
int w, h, c;

void dfs(int x, int y, visited& v, marine_map& m, int& c) {
    if (v[y][x]) {
        return;
    }
    v[y][x] = true;
    for (int p = 0; p < 8; p++) {
        int cy = y + dy[p];
        int cx = x + dx[p];
        if (cx < 0 || cx >= w || cy < 0 || cy >= h || m[cy][cx] != 1) {
            continue;
        }
        dfs(cx, cy, v, m, c);
    }
}


int main() {
    while (true) {
        std::cin >> w >> h;
        if (w == 0 && h == 0) {
            break;
        }
        c = 0; // reset counter for new map;
        std::vector<std::vector<int>> vec(h, std::vector<int>(w, 0));
        std::vector<std::vector<bool>> bools(h, std::vector<bool>(w, false));
        for (int i = 0; i < h; i++) {
            for (int p = 0; p < w; p++) {
                std::cin >> vec[i][p];
            }
        }
        for (int i = 0; i < h; i++) {
            for (int p = 0; p < w; p++) {
                if (vec[i][p] == 1 && !bools[i][p]) {
                    c++;
                    dfs(p, i, bools, vec, c);
                }
            }
        }
        std::cout << c << std::endl;
    }
}

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

using namespace std;

typedef long long ll;
typedef pair<int,int> P;

int c[100][100];//0??????
int h,w;

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

void bfs(int i,int j){
    queue<P> q;
    q.push(P(i,j));
    c[i][j]=0;
    while(!q.empty()){
        int x=q.front().first,y=q.front().second;
        q.pop();
        for(int i=0;i<8;i++){
            int nx=x+dx[i],ny=y+dy[i];
            if(0<=nx&&nx<h&&0<=ny&&ny<w&&c[nx][ny]==1){
                q.push(P(nx,ny));
                c[nx][ny]=0;
            }
        }
    }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  while(true){
      cin>>w>>h;
      if(w==0&&h==0) break;
      for(int i=0;i<h;i++)for(int j=0;j<w;j++){
          cin>>c[i][j];
      }
      int res=0;
      for(int i=0;i<h;i++)for(int j=0;j<w;j++){
          if(c[i][j]==1){
              bfs(i,j);
              res++;
          }
      }
      cout<<res<<endl;
  }
}

C++: #include<bits/stdc++.h>
using namespace std;
int g[52][52];
void solve(int x,int y){
  g[x][y]=0;
  for(int i=-1;i<=1;++i){
    for(int j=-1;j<=1;++j){
      if(g[x+i][y+j]) solve(x+i,y+j);
    }
  }
}
int main(){
  int w,h,cnt;
  while(cin>>w>>h&&w&&h){
    cnt=0;
    for(int i=0;i<=h+1;++i){
      for(int j=0;j<=w+1;++j){
        if(i==0||j==0||i==h+1||j==w+1) g[i][j]=0;
        else cin>>g[i][j];
      }
    }
    for(int i=1;i<=h;++i){
      for(int j=1;j<=w;++j){
        if(g[i][j]){
          solve(i,j);
          ++cnt;
        }
      }
    }
    cout<<cnt<<endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int w, h;
int c[51][51];

bool valid(int i, int j) {
    return (0 <= i && i < h && 0 <= j && j < w);
}

void go(int y, int x) {
    if (c[y][x] == 0) return ;
    c[y][x] = 0;

    for (int i=y-1; i<=y+1; ++i) {
        for (int j=x-1; j<=x+1; ++j) {
            if (valid(i, j)) go(i, j);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);

    while (1) {
        cin >> w >> h;
        if (w == 0 && h == 0) break;

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

        int ans = 0;
        for (int i=0; i<h; ++i) {
            for (int j=0; j<w; ++j) {
                if (c[i][j]) {
                    go(i, j);
                    ans ++;
                }
            }
        }
        cout << ans << endl;
    }

    return 0;
}