Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

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;
}