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

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

bool dfs(int x,int y){
    if(visited[x][y]) return false;
    visited[x][y]=1;

    for(int d=0;d<8;d++){
        int i=x+dx[d];
        int j=y+dy[d];
        if(0<=i&&i<h&&0<=j&&j<w){
            if(c[i][j]){
                dfs(i,j);
            }  
        }
    }
    return true;
}

int main(){
    visited.assign(50,vector<int>(50,0));
    cin>>w>>h;
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            cin>>c[i][j];
        }
    }
    int cnt=0;
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(c[i][j]){
                cnt+=dfs(i,j);
            }
        }
    }

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

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

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


void dfs(int x, int y){
	c[y][x] = 0;
	for(int i = 0; i < 8; i++){
		int mx = x + dx[i], my = y + dy[i];
		if( mx < 0 || my < 0 || w <= mx || h <= my ) continue;
		
		if( c[my][mx] == 1 ) dfs(mx, my);
	}
}

int main(){
	while( cin >> w >> h , w || h ){
		for(int y = 0; y < h; y++){
			for(int x = 0; x < w; x++){
				cin >> c[y][x];
			}
		}
		int ans = 0;
		for(int y = 0; y < h; y++){
			for(int x = 0; x < w; x++){
				if( c[y][x] == 1 ){
					ans++;
					dfs(x, y);
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include<stdio.h>
int h,w;
int map[50][50];
void func(int ,int);
int main(void){
	while(1){
		scanf("%d %d",&w,&h);
		if(h==0 && w==0){
			break;
		}
		int i,j;
		for(i=0;i<h;i++){
			for(j=0;j<w;j++){
				scanf("%d",&map[i][j]);
			}
		}
		/*for(i=0;i<h;i++){
			for(j=0;j<w;j++){
				printf("%d ",map[i][j]);
			}
			printf("\n");
		}*/
		int cnt=0;
		for(i=0;i<h;i++){
			for(j=0;j<w;j++){
				if(map[i][j]==1){
					map[i][j]=0;
					func(i,j);
					cnt++;
				}
			}
		}
		printf("%d\n",cnt);
		cnt=0;
	}
	return 0;
}
void func(int y,int x){
	int dy[8]={1,0,0,-1,-1,-1,1,1},dx[8]={0,1,-1,0,-1,1,-1,1};
	int i,j,xx,yy;
	for(i=0;i<8;i++){
		yy=y+dy[i];
		xx=x+dx[i];
		if(yy>=0 && yy<h && xx>=0 && xx<w && map[yy][xx]==1){
			map[yy][xx]=0;
			func(yy,xx);
		}
	}
}

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

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

using namespace std;

int main(){

  while(1){
  
    int w,h;cin>>w>>h;if(w==0&&h==0){return 0;}

  int c[h+2][w+2];memset(c,0,sizeof(c));

  for(int i=1;i<=h;i++){
    for(int j=1;j<=w;j++){
      cin>>c[i][j];
    }
  }

  queue<pair<int,int> > q;

  bool a[h+2][w+2];

  for(int i=0;i<=h+1;i++){
    for(int j=0;j<=w+1;j++){
      a[i][j]=false;
    }
  }

  int ans=0;

  for(int i=1;i<=h;i++){
    for(int j=1;j<=w;j++){
      if(c[i][j]==1&&a[i][j]==false){
	ans++;
	q.push(make_pair(i,j));
	while(!q.empty()){
	  pair<int,int> tmp=q.front();q.pop();
	  int x=tmp.first;
	  int y=tmp.second;

	  for(int i=0;i<8;i++){
	    int checkx=dx[i]+x;
	    int checky=dy[i]+y;
	    if(a[checkx][checky]==false&&c[checkx][checky]==1){
	      a[checkx][checky]=true;
	      q.push(make_pair(checkx,checky));
	    }
	  }
	  
	}
      }
    }
  }

  cout<<ans<<endl;

  }
  
  return 0;
}

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

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const ll INF = 1LL<<60;


ll w,h;
const ll dx[]={-1,0,1,-1,1,-1,0,1},dy[]={-1,-1,-1,0,0,1,1,1};

// void dfs(ll height,ll width,ll map[height][width],ll check[height][width]){

// }

int main(){

  while(cin>>w>>h){
    if(w==0&&h==0)break;

    ll map[h][w];
    ll check[h][w];
    rep(i,0,h){
      rep(j,0,w){
        cin>>map[i][j];
        check[i][j]=-1;
      }
    }
    ll num=0;
    rep(i,0,h){
      rep(j,0,w){
        if(map[i][j]==1&&check[i][j]==-1){
          num++;
          stack<P>s;
          s.push(P(i,j));

          while(!s.empty()){
            P p=s.top();s.pop();
            ll y=p.first,x=p.second;

            check[y][x]=num;
            rep(i,0,8){
              ll ny=y+dy[i],nx=x+dx[i];
              if(IN(0,h,ny)&&IN(0,w,nx)&&map[ny][nx]==1&&check[ny][nx]==-1){
                s.push(P(ny,nx));
              }
            }
          }
        }
      }
    }

    out(num);

  }


  return 0;
}