Go: package main

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

var sc = bufio.NewScanner(os.Stdin)
var route [][]int

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func dfs(h, w int) {
	if route[h][w] == 0 {
		return
	}

	route[h][w] = 0
	for _, x := range []int{-1, 0, 1} {
		for _, y := range []int{-1, 0, 1} {
			if route[h+x][w+y] == 0 {
				continue
			}
			dfs(h+x, w+y)
		}
	}
}

func main() {
	writer := bufio.NewWriter(os.Stdout)
	for {
		w, h := scanInt(), scanInt()
		if w == 0 && h == 0 {
			break
		}

		route = make([][]int, h+2)
		route[0] = make([]int, w+2)
		for i := 1; i <= h; i++ {
			route[i] = make([]int, w+2)
			for j := 1; j <= w; j++ {
				route[i][j] = scanInt()
			}
		}
		route[h+1] = make([]int, w+2)

		total := 0
		for i := 1; i <= h; i++ {
			for j := 1; j <= w; j++ {
				if route[i][j] == 1 {
					total++
					dfs(i, j)
				}
			}
		}
		fmt.Fprintln(writer, total)
	}
	writer.Flush()
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int w,h,ans;
  bool b;
  int mp[70][70];
  while(1){
    cin>>w>>h;
    if(w==0 && h==0) break;
    for(int i=0;i<70;i++){
      for(int j=0;j<70;j++){
	mp[i][j]=0;
      }
    }
    ans=2;
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++){
	cin>>mp[i][j];
      }
    }
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++){
	b=true;
	if(mp[i][j]==1){
	  mp[i][j]=ans;
	  while(b){
	    b=false;
	    for(int k=1;k<=h;k++){
	      for(int l=1;l<=w;l++){
		if(mp[k][l]==ans){
		  for(int m=k-1;m<=k+1;m++){
		    for(int n=l-1;n<=l+1;n++){
		      if(mp[m][n]==1){
			mp[m][n]=ans;
			b=true;
		      }
		    }
		  }
		}
	      }
	    }
	  }
	  ans++;
	}
      }
    }
    cout<<ans-2<<endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

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

void dfs(int y,int x);

int main(){
  int cnt;
  while(cin >> w >> h,w|h){
    cnt = 0;
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
	cin>>maps[i][j];
      }
    }
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
	if(maps[i][j] == 1){
	  cnt++;
	  dfs(i,j);
	}
      }
    }
    cout << cnt << endl;
  }
}

void dfs(int y,int x){
  maps[y][x] = 0;
  for(int i = 0; i < 9;i++){
    int sy = y + dy[i];
    int sx = x + dx[i];
    if(sy >= 0 && sy < h && sx >= 0 && sx < w && maps[sy][sx] == 1){
      dfs(sy,sx);
    }
  }
  return;
}

C++: #include <iostream>
using namespace std;
int h,w,dp[50][50],dx[]={0,0,1,1,1,-1,-1,-1},dy[]={1,-1,0,1,-1,0,1,-1},ch[50][50],ans;
void dfs(int x,int y){
    for(int i=0;i<8;i++){
        int nx=x+dx[i];
        int ny=y+dy[i];
        if(0<=nx&&nx<h&&0<=ny&&ny<w&&dp[nx][ny]==1){
            if(ch[nx][ny]==0){
                ch[nx][ny]=1;
                dfs(nx,ny);
            }
        }
    }
    return ;
}
int main(void){
    while(1){
        cin>>w>>h;
        if(w==0&&h==0)return 0;
        ans=0;
        for(int i=0;i<h;i++)for(int j=0;j<w;j++){
            ch[i][j]=0;
            cin>>dp[i][j];
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(dp[i][j]==1&&ch[i][j]==0){
                    dfs(i,j);
                    ans++;
                }
            }
        }
        cout<<ans<<endl;
    }
}

C++: #include <iostream>

using namespace std;

int w, h;
int m[50][50];
void paint(int x, int y) {
	if (x < 0 || x >= w || y < 0 || y >= h) return;
	if (m[y][x] == 0) return;
	m[y][x] = 0;
	for (int dx = -1; dx <= 1; ++dx) for (int dy = -1; dy <= 1; ++dy) {
		paint(x+dx, y+dy);
	}
}
int main() {
	while ( cin >> w >> h, w || h ) {
		for (int y = 0; y < h; ++y) {
			for (int x = 0; x < w; ++x) {
				cin >> m[y][x];
			}
		}
		int ans = 0;
		for (int y = 0; y < h; ++y) {
			for (int x = 0; x < w; ++x) {
				if (m[y][x]) {
					paint(x, y);
					++ans;
				}
			}
		}
		cout << ans << endl;
	}
}

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

using namespace std;
typedef long long ll;

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


void dfs(int x, int y, int px=-1, int py=-1) {
    c[x][y] = 0;
    for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx == px && ny == py) continue;
        if (nx < 0 || nx >= h) continue;
        if (ny < 0 || ny >= w) continue;
        if (c[nx][ny] == 0) continue;
        dfs(nx, ny, x, y);
    }
}

int main() {
    while (true) {
        cin >> w >> h;
        if (w == 0 && h == 0) break;
        c.resize(h);
        for (int i = 0; i < h; i++) {
            c[i].resize(w);
            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] == 0) continue;
                dfs(i, j);
                ans++;
            }
        }
        cout << ans << endl;
    }
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int table[105][105];
int check(int i, int j){
  for(int a=i-1; a<i+2; a++){
    for(int b=j-1; b<j+2; b++){
      if(table[a][b]==1){
        table[a][b]=0;
        check(a,b);
      }
    }
  }
  return 0;
}
int main(){
  int w,h;
  while(1){
    cin >> w >> h;
    if(w==0 && h==0) break;
    table[w+2][h+2]={};
    rep(i,h) rep(j,w) cin >> table[i+1][j+1];
    rep(i,h+1){
      rep(j,w+1){
        if(table[i][j]==1){
          table[i][j]=2;
          check(i,j);
        }
      }
    }
    int count=0;
    for(int i=1; i<h+1; i++) for(int j=1; j<w+1; j++) if(table[i][j]==2) count++;
    cout << count << endl;
    /*rep(i,h+2){
      rep(j,w+2) cout << table[i][j] << " ";
      cout << endl;
    }*/
  }
  return 0;
}