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>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
bool find1(vector< vector<int> >& C,vector< vector<int> >& check,int* findh,int* findw)
{
  for(int i = 0;i < C.size();++i)
    for(int j = 0;j < C[0].size();++j)
      if(C[i][j] == 1 && check[i][j] == 0){
	*findh = i;
	*findw = j;
	return true;
      }
  return false;
}
bool find2(vector< vector<int> >& C,vector< vector<int> >& check,int* findh,int* findw)
{
  if(C[*findh - 1][*findw - 1] == 1 && check[*findh - 1][*findw - 1] == 0){
    *findh -= 1;
    *findw -= 1;
    return true;
  }
  else if(C[*findh - 1][*findw] == 1 && check[*findh - 1][*findw] == 0){
    *findh -= 1;
    return true;
  }
  else if(C[*findh - 1][*findw + 1] == 1  && check[*findh - 1][*findw + 1] == 0){
    *findh -= 1;
    *findw += 1;
    return true;
  }
  else if(C[*findh][*findw - 1] == 1 && check[*findh][*findw - 1] == 0){
    *findw -= 1;
    return true;
  }
  else if(C[*findh][*findw + 1] == 1 && check[*findh][*findw + 1] == 0){
    *findw += 1;
    return true;
  }
  else if(C[*findh + 1][*findw - 1] == 1 && check[*findh + 1][*findw - 1] == 0){
    *findh += 1;
    *findw -= 1;
    return true;
  }
  else if(C[*findh + 1][*findw] == 1 && check[*findh + 1][*findw] == 0){
    *findh += 1;
    return true;
  }
  else if(C[*findh + 1][*findw + 1] == 1 && check[*findh + 1][*findw + 1] == 0){
    *findh += 1;
    *findw += 1;
    return true;
  }
  else return false;
}
int main()
{
  int w,h,findh,findw;
  stack< pair<int,int> > finish;
  queue<int> answer;
  while(cin >> w >> h && !(w == 0 && h == 0)){
    int howmany = 0;
    vector< vector<int> > C(h + 2,vector<int>(w + 2,0)),check(h + 2,vector<int>(w + 2,0)); 
    for(int i = 1;i <= h;++i)
      for(int j = 1;j <= w;++j)
	cin >> C[i][j];
    while(find1(C,check,&findh,&findw)){
      check[findh][findw] = 1;
      finish.push(make_pair(findh,findw));
      while(!finish.empty()){
	findh = finish.top().first;
	findw = finish.top().second;
	while(find2(C,check,&findh,&findw)){
	  finish.push(make_pair(findh,findw));
	  check[findh][findw] = 1;
	}
	finish.pop();
      }
      ++howmany;
    }
    answer.push(howmany);
  }
  for(;!answer.empty();answer.pop())
    cout << answer.front() << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int n,m;
int v[100][100];
bool used[100][100];
int dir[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

void dfs(int i, int j){
    if((v[i][j]==0) || (used[i][j]==true)){
        return;
    }
    used[i][j]=true;
    rep(k,8){
        if(i+dir[k][0]<=n-1 && 0<=i+dir[k][0]){
            if(j+dir[k][1]<=m-1 && 0<=j+dir[k][1]){
                dfs(i+dir[k][0],j+dir[k][1]);
            }
        }
    }
    return;
}

int main(){
    vector<int> ans;

    while(true){
        cin >> m >> n;
        if(n==0 && m==0)break;
        rep(i,n){
            rep(j,m){
                cin >> v[i][j];
            }
        }

        int res=0;
        rep(i,n){
            rep(j,m){
                used[i][j]=false;
            }
        }
        rep(i,n){
            rep(j,m){
                if(v[i][j]==1 && used[i][j]==false){
                    dfs(i,j);
                    res++;
                }
            }
        }
        ans.push_back(res);
    }

    rep(i,ans.size()){
        cout << ans[i] << endl;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
bool ban[52][52];
	void dfs(int x,int y){
		ban[y][x]=0;
		for(int i=-1;i<=1;i++){
			for(int j=-1;j<=1;j++){
				if(ban[y+i][x+j]==true){
					dfs(x+j,y+i);
				}
			}
		}
	}
int main(){
	int w,h;
	while(cin>>w>>h,h+w!=0){
		for(int i=0;i<h;i++)ban[i][0]=0,ban[i][h+1]=0;//番兵
		for(int i=0;i<w;i++)ban[0][i]=0,ban[0][w+1]=0;//
		for(int i=1;i<=h;i++){
			for(int j=1;j<=w;j++)cin>>ban[i][j];
		}
	int cnt=0;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(ban[i][j]==true){
				dfs(j,i);
				cnt++;
			}
		}	
	}
		cout<<cnt<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
int d[51][51];
int used[51][51];
typedef pair<int,int> P;

signed main(){
  int W,H;
  std::vector<int> fans;
  while(true){
    cin>>W>>H;if(W==0&&H==0)break;
    for(int i=0;i<H;i++)for(int j=0;j<W;j++)cin>>d[i][j];
    for(int i=0;i<51;i++)for(int j=0;j<51;j++)used[i][j]=0;
    int ans=0;
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
        if(used[i][j]||d[i][j]==0)continue;
        used[i][j]=1;ans++;
        queue<P> que;que.push(P(i,j));
        while(que.size()){
          P p=que.front();que.pop();
          for(int k=max(0LL,p.first-1);k<=min(H-1,p.first+1);k++){
            for(int l=max(0LL,p.second-1);l<=min(W-1,p.second+1);l++){
              if(used[k][l]==0&&d[k][l]){
                used[k][l]++;que.push(P(k,l));
              }
            }
          }
        }
      }
    }
    fans.push_back(ans);
  }
  for(int i=0;i<fans.size();i++)cout<<fans[i]<<endl;
}

C++: #include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
				
				
void del_island(int i,int j,vector<vector<int>> &v){	
	v[i][j] = 0;
	if(v[i-1][j] == 1){
		del_island(i-1,j,v);
	}
	if(v[i+1][j] == 1){
		del_island(i+1,j,v);
	}
	if(v[i][j-1] == 1){
		del_island(i,j-1,v);
	}
	if(v[i][j+1] == 1){
		del_island(i,j+1,v);
	}
	if(v[i-1][j-1] == 1){
		del_island(i-1,j-1,v);
	}
	if(v[i-1][j+1] == 1){
		del_island(i-1,j+1,v);
	}
	if(v[i+1][j-1] == 1){
		del_island(i+1,j-1,v);
	}
	if(v[i+1][j+1] == 1){
		del_island(i+1,j+1,v);
	}

}


int count_island(int w, int h,vector<vector<int>> v){
	int count = 0;
	for(int i = 1 ; i <= h ;i++){
		for(int j = 1 ;j <= w ;j++){
			//cout << v[i][j] ;
			if(v[i][j] == 1){
				count++;
				//cout << "hello" <<endl;
				del_island(i,j,v);
			}
		}
	}
	return count;
}
	
int main(){ 
	int w,h;
	vector<vector<int>> v(60,vector<int>(60,0));
	int count;

	while(1){
		cin >> w >> h;
		if(w == 0 && h == 0){
			break;
		}
		count = 0; 
		for(int i = 1; i <= h ; i++){
			for(int j = 0 ; j <= w ; j++){
				v[i][j] = 0;
			}
		}

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

		count = count_island(w,h,v);


		cout << count << endl;
	}
}

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

int N,M;
char filed[100][101];

void dfs(int x,int y){
  filed[x][y]='.';
  
  for(int dx=-1;dx<=1;dx++){
    for(int dy=-1;dy<=1;dy++){
      int nx=x+dx,ny=y+dy;
      if(0<=nx&&nx<N&&0<=ny&&ny<M&&filed[nx][ny]=='W')dfs(nx,ny);
    }
  }
}

void solve(){
  int res=0;
  for(int i=0;i<N;i++){
    for(int j=0;j<M;j++){
      if(filed[i][j]=='W'){
	dfs(i,j);
	res++;
      }
    }
  }
  cout<<res<<endl;
}
int main(){
  cin>>N>>M;
  for(int i=0;i<N;i++){
    for(int j=0;j<M;j++){
      cin>>filed[i][j];
    }
  }
  
  solve();
  return 0;
}