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