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<cstdio>
using namespace std;
void func(int,int);
int a,b;
int sima[51][51];
int cnt;
int main(void)
{
	int i,j,x,y;
	scanf("%d",&a);
	scanf("%d",&b);
	while(!(b==0 && a==0)){
		
		for(i=0;i<b;i++){
			for(j=0;j<a;j++){
				scanf("%d",&sima[i][j]);
			}
		}
		cnt=0;
		for(i=0;i<b;i++){
			for(j=0;j<a;j++){
				if(sima[i][j]==1){
					func(i,j);
					cnt++;
				}
			}
		}
		printf("%d\n",cnt);
		scanf("%d",&a);
		scanf("%d",&b);
	}
	return 0;
}
void func(int y,int x)
{
	if(y-1>=0){
		if(sima[y-1][x]==1){
			sima[y-1][x]=0;
			func(y-1,x);
		}
	}
	if(x-1>=0){
		if(sima[y][x-1]==1){
			sima[y][x-1]=0;
			func(y,x-1);	
		}
	}
	if(y+1<=a){
		if(sima[y+1][x]==1){
			sima[y+1][x]=0;
			func(y+1,x);
		}
	}
	if(x+1<=b){
		if(sima[y][x+1]==1){
			sima[y][x+1]=0;
			func(y,x+1);
		}
	}
	if(y-1>=0 && x+1<=b){
		if(sima[y-1][x+1]==1){
			sima[y-1][x+1]=0;
			func(y-1,x+1);
		}
	}
	if(y-1>=0 && x-1>=0){
		if(sima[y-1][x-1]==1){
			sima[y-1][x-1]=0;
			func(y-1,x-1);
		}
	}
	if(y+1<=a && x+1<=b){
		if(sima[y+1][x+1]==1){
			sima[y+1][x+1]=0;
			func(y+1,x+1);
		}
	}
	if(y+1<=a && x-1>=0){
		if(sima[y+1][x-1]==1){
			sima[y+1][x-1]=0;
			func(y+1,x-1);
		}
	}
}

C++: #include <iostream>
#include <vector>
using namespace std;
#define repeat(i,n) for (int i = 0; (i) <(int) (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) <(int) (n); ++(i))
void dfs(int x, int y, int n, vector<vector<int> > & k, vector<vector<bool> > const & c) {
    int h = c.size();
    int w = c.front().size();
    if (x < 0 or w <= x or y < 0 or h <= y) return;
    if (k[y][x] or not c[y][x]) return;
    k[y][x] = n;
    repeat_from (dy,-1,1+1) {
        repeat_from (dx,-1,1+1) {
            dfs(x+dx,y+dy,n,k,c);
        }
    }
}
int solve(vector<vector<bool> > const & c) {
    int h = c.size();
    int w = c.front().size();
    vector<vector<int> > k(h, vector<int>(w, 0));
    int n = 0;
    repeat (y,h) {
        repeat (x,w) {
            if (not k[y][x] and c[y][x]) {
                dfs(x,y,++n,k,c);
            }
        }
    }
    return n;
}
int main(void) {
    while (true) {
        int w, h; cin >> w >> h;
        if (w == 0 and h == 0) break;
        vector<vector<bool> > c(h, vector<bool>(w));
        repeat (y,h) {
            repeat (x,w) {
                int t; cin >> t;
                c[y][x] = t;
            }
        }
        cout << solve(c) << endl;
    }
    return 0;
}

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

int ans = 0;
int w,h;
int map[100][100] ={};


void search(int y,int x){

  //  cout << "search"<< y <<" " << x << endl;
  map[y][x] = 0;

  for(int dy = -1 ; dy <= 1 ; dy++){
    for(int dx = -1 ; dx <= 1 ; dx++){
      int nx = x + dx, ny = y + dy;
      if(nx >= 0 && ny >= 0 && nx < w && ny < h && map[ny][nx] == 1 ){
	search(ny,nx);
      }
    }
  }
  /*
    if( map[y][x] == 0 ){
    //テ・ツ渉ウテァツォツッ
    if(x+1 == w){
      //テヲツ慊?・ツセツ?
      if(y+1 == h){
      }
      //テヲツ慊?」ツつづ、ツクツ凝」ツ?ョテヲツョツオ
      else{
	search(y+1,x);
    }else{
      search(y,x+1);
    }
  }
  */
}


int main(){

  while(1){

    ans = 0;
    cin >> w >> h ;

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

    for(int i = 0 ; i < h ; i++){
      for(int j = 0 ; j < w ; j++){
	cin >> map[i][j];
      }
    }
    //map テ・ツ?コテ・ツ環?
    /*
    for(int i = 0 ; i < h ; i++){
      for(int j = 0 ; j < w ; j++){
	cout << map[i][j];
      }
      cout << endl;
    }
    //    cout << endl;
    */
    for(int i = 0 ; i < h ; i++){
      for(int j = 0 ; j < w ; j++){
	if(map[i][j] == 1){
	  ans++;
	  search(i,j);
	}
      }
    }
    cout << ans << endl;
  }
  return 0;
}

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

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

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

bool memo[55][55];
int d[55][55];

bool can(int y,int x) {
    if(0 <= y && y < h && 0 <= x && x < w) return true;
    return false;
}

void dfs(int y,int x) {
    if(memo[y][x]) return;
    memo[y][x] = true;
    
    rep(i,8) {
        int ny = y + dy[i];
        int nx = x + dx[i];
        
        if(can(ny,nx) && d[ny][nx] == 1) {
            dfs(ny,nx);
        }
    }
}


int main()
{
    while(cin >> w >> h)
    {
        if(w == 0 && h == 0) break;
        
        memset(d,0,sizeof(d));
        memset(memo,0,sizeof(memo));

        rep(i,h) {
            rep(j,w) {
                cin >> d[i][j];
            }
        }
        
        int ans = 0;
        rep(i,h) {
            rep(j,w) {
                if(!memo[i][j] && d[i][j] == 1) {
                    ans++;
                    dfs(i,j);
                }
            }
        }

        cout << ans << endl;
    }

    return 0;
}