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 <queue>
#include <utility>
#include <vector>
using namespace std;

int main() {
	int w, h;
	while (cin >> w >> h, h || w) {
		vector<vector<int>> c(h, vector<int>(w));
		for (vector<int>& i : c) {
			for (int& j : i) cin >> j;
		}
		int ans = 0;
		vector<vector<bool>> a(h, vector<bool>(w));
		for (int i = 0; i < h; ++i) {
			for (int j = 0; j < w; ++j) {
				if (!a[i][j] && c[i][j]) {
					++ans;
					a[i][j] = true;
					queue<pair<int, int>> b;
					b.emplace(i, j);
					while (!b.empty()) {
						if (b.front().first) {
							if (!a[b.front().first - 1][b.front().second] && c[b.front().first - 1][b.front().second]) {
								a[b.front().first - 1][b.front().second] = true;
								b.emplace(b.front().first - 1, b.front().second);
							}
							if (b.front().second) {
								if (!a[b.front().first - 1][b.front().second - 1] && c[b.front().first - 1][b.front().second - 1]) {
									a[b.front().first - 1][b.front().second - 1] = true;
									b.emplace(b.front().first - 1, b.front().second - 1);
								}
							}
							if (b.front().second != w - 1) {
								if (!a[b.front().first - 1][1 + b.front().second] && c[b.front().first - 1][1 + b.front().second]) {
									a[b.front().first - 1][1 + b.front().second] = true;
									b.emplace(b.front().first - 1, 1 + b.front().second);
								}
							}
						}
						if (b.front().first != h - 1) {
							if (!a[1 + b.front().first][b.front().second] && c[1 + b.front().first][b.front().second]) {
								a[1 + b.front().first][b.front().second] = true;
								b.emplace(1 + b.front().first, b.front().second);
							}
							if (b.front().second != w - 1) {
								if (!a[1 + b.front().first][1 + b.front().second] && c[1 + b.front().first][1 + b.front().second]) {
									a[1 + b.front().first][1 + b.front().second] = true;
									b.emplace(1 + b.front().first, 1 + b.front().second);
								}
							}
						}
						if (b.front().second) {
							if (!a[b.front().first][b.front().second - 1] && c[b.front().first][b.front().second - 1]) {
								a[b.front().first][b.front().second - 1] = true;
								b.emplace(b.front().first, b.front().second - 1);
							}
							if (b.front().first != h - 1) {
								if (!a[1 + b.front().first][b.front().second - 1] && c[1 + b.front().first][b.front().second - 1]) {
									a[1 + b.front().first][b.front().second - 1] = true;
									b.emplace(1 + b.front().first, b.front().second - 1);
								}
							}
						}
						if (b.front().second != w - 1) {
							if (!a[b.front().first][1 + b.front().second] && c[b.front().first][1 + b.front().second]) {
								a[b.front().first][1 + b.front().second] = true;
								b.emplace(b.front().first, 1 + b.front().second);
							}
						}
						b.pop();
					}
				}
			}
		}
		cout << ans << endl;
	}
}

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

using namespace std;

queue<int> Q;
int A[52][52];
int UP[8]  ={-1, -1, 1, 0, 1, 1, 1, 0};
int SIDE[8]={-1, 0, 1, 1, 1, 0, -1, -1};


void route(int w,int h){

  A[w][h]=0;
  if(A[w+1][h+1]==1)route(w+1,h+1);
  if(A[w+1][h]==1)route(w+1,h);
  if(A[w+1][h-1]==1)route(w+1,h-1);
  if(A[w][h+1]==1)route(w,h+1);
  if(A[w][h-1]==1)route(w,h-1);
  if(A[w-1][h+1]==1)route(w-1,h+1);
  if(A[w-1][h]==1)route(w-1,h);
  if(A[w-1][h-1]==1)route(w-1,h-1);


}

int main(){
  int w,h;
  int count;
  while(true){
    cin>>w>>h;
    if(w==0&&h==0)break;
    for(int i = 1;i<=h;i++){
      for(int j = 1;j<=w;j++){
	cin>>A[i][j];
     
      }
    }
    count=0;
    for(int i = 1;i<=h;i++){
      for(int j = 1;j<=w;j++){
	if(A[i][j]==1){
	  //	  cout<<i<<" "<<j<<endl; 
	  route(i,j);
	  count++;
	}
      }
    }

    //デバック
   
    /*     for(int i = 1;i<=h;i++){
      for(int j = 1;j<=w;j++){
	cout<<" "<<A[i][j];
      }
      cout <<endl;
      }*/
    
    cout<<count<<endl;
   }
  return 0;

}

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

using namespace std;


#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

int h,w;

int c[52][52];

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


void dfs(int i,int j);



int main(){


	while(1){
		cin >> w >> h;

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

		cnt=0;

		REP(i,h){
			REP(j,w){


				cin >> c[i][j] ;

			}
		}

		REP(i,h){
			REP(j,w){

				//cnt++??????????????\???????????????????????\???????????????
				if(c[i][j] == 1){
					cnt++;
					dfs(j,i);
				}
			}
		}

		cout << cnt << endl;
	}
	return 0;
}

void dfs(int i,int j){

	if(c[j][i] == 1){

		c[j][i] = 0;
		REP(k,8){
			//w???<=???????????£??????????????????
			if(0 <= i+dx[k] && i+dx[k] < w && 0 <= j+dy[k] && j+dy[k] < h){

				dfs(i+dx[k],j+dy[k]);
			}
		}
	}
}