Go: ///
// File:  1160.go
// Author: ymiyamoto
//
// Created on Sun Mar  4 20:45:57 2018
//
package main

import (
	"fmt"
)

var w, h int
var graph [][]string

func dfs(visited [][]bool, x, y int) {
	visited[x][y] = true

	for i := -1; i <= 1; i++ {
		for j := -1; j <= 1; j++ {
			dx := x + i
			dy := y + j
			if 0 <= dx && dx < h && 0 <= dy && dy < w && graph[dx][dy] == "1" && !visited[dx][dy] {
				dfs(visited, dx, dy)
			}
		}
	}
}

func main() {
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			break
		}

		graph = make([][]string, h)
		for i := range graph {
			graph[i] = make([]string, w)
		}

		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				var s string
				fmt.Scan(&s)
				graph[i][j] = s
			}
		}

		visited := make([][]bool, h)
		for i := range visited {
			visited[i] = make([]bool, w)
		}

		count := 0
		for i := range graph {
			for j := range graph[i] {
				if graph[i][j] == "1" && !visited[i][j] {
					dfs(visited, i, j)
					count++
				}
			}
		}

		fmt.Println(count)
	}
}

C++: #include <iostream>
using namespace std;
int cnt,w,h;
int map[51][51];
void check(int i,int j){
	if(map[i][j]!=1)return;
	map[i][j]=2;
	if(i>0)check(i-1,j);
	if(i<h-1)check(i+1,j);
	if(j>0)check(i,j-1);
	if(j<w-1)check(i,j+1);
	if(i>0&&j>0)check(i-1,j-1);
	if(i>0&&j<w-1)check(i-1,j+1);
	if(i<h-1&&j>0)check(i+1,j-1);
	if(i<h-1&&j<w-1)check(i+1,j+1);
}


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

	}
}

C++: #include<bits/stdc++.h>
using namespace std;
char a[50][50];
void calc(int i,int j){
  if(a[i][j]=='1'){
    a[i][j]=2;
    calc(i+1,j);
    calc(i,j+1);
    calc(i+1,j+1);
    calc(i+1,j-1);
    calc(i-1,j);
    calc(i,j-1);
    calc(i-1,j-1);
    calc(i-1,j+1);
  }
  else return;
}

int main(){
  while(1){
  int w,h;
  cin>>w>>h;
  if(w==0&&h==0) break;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      cin>>a[i][j];
    }
  }
  int count=0;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      if(a[i][j]=='1'){
	count++;
	calc(i,j);
      }
    }
  }
  cout<<count<<endl;
  }
  return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)

int masu[55][55];
int w,h;

void saiki(int y,int x){
	if(y<0 || x<0 || y>=h || x>=w)return;
	if(masu[y][x]==0)return;
	masu[y][x]=0;
	
	int dx[]={0,1,0,-1,-1,-1,1,1};
	int dy[]={1,0,-1,0,1,-1,1,-1};
	
	rep(i,8){
		saiki(y+dy[i],x+dx[i]);
	}
}

int main(){
	
	A:
	cin>>w>>h;
	if(w==0 && h==0)return 0;
	
	rep(i,h){
		rep(j,w){
			cin>>masu[i][j];
		}
	}
	
	int count = 0;
	rep(i,h){
		rep(j,w){
			if(masu[i][j]==1){
				count++;
				saiki(i,j);
			}
		}
	}
	printf("%d\n",count);
	
	goto A;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <sstream>
#include <numeric>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>

///////////////////////////////////////////////////////////////
// namespace
///////////////////////////////////////////////////////////////
using namespace std;
// namespace mp = boost::multiprecision;

///////////////////////////////////////////////////////////////
// types
///////////////////////////////////////////////////////////////
using pii = pair<int, int>;
using ll = long long int;
using ld = long double;
// using mpi = mp::cpp_int;
// using mpf = mp::number<mp::cpp_dec_float<1024>>;

///////////////////////////////////////////////////////////////
// mod https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
///////////////////////////////////////////////////////////////
// ll MOD = 1000000007;
// ll mod(long long val) {
//     long long res = val % MOD;
//     if (res < 0) res += MOD;
//     return res;
// }
// ll modinv(ll a) {
//     ll b = MOD, u = 1, v = 0;
//     while (b) {
//         ll t = a / b;
//         a -= t * b; swap(a, b);
//         u -= t * v; swap(u, v);
//     }
//     u %= MOD;
//     if (u < 0) u += MOD;
//     return u;
// }

int w, h;
vector<vector<int>> c;

bool dfs(int i, int j) {
    if (c[i][j] == 0) return false;
    c[i][j] = 0;
    if (i - 1 >= 0) dfs(i - 1, j);
    if (i + 1 < h) dfs(i + 1, j);
    if (j - 1 >= 0) dfs(i, j - 1);
    if (j + 1 < w) dfs(i, j + 1);
    if (i - 1 >= 0 && j - 1 >= 0) dfs(i - 1, j - 1);
    if (i - 1 >= 0 && j + 1 < w) dfs(i - 1, j + 1);
    if (i + 1 < h && j + 1 < w) dfs(i + 1, j + 1);
    if (i + 1 < h && j - 1 >= 0) dfs(i + 1, j - 1);
    return true;
}

bool solve() {
    cin >> w >> h;
    if (w == 0 && h == 0) return false;
    c = vector<vector<int>>(h, vector<int>(w));
    for (int i = 0; i < h; ++i) {
        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) {
            ans += dfs(i, j);
        }
    }
    cout << ans << endl;
    return true;
}

int main() {
    while (solve());
    return 0;
}

C++: #include<bits/stdc++.h>
/*
#include<iostream>
#include<vector>
#include<algorithm>
 */
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)

int h, w;
bool c[50][50];
int cnt;
int reached[50][50];
void dfs(int y, int x) {
    rep3(i, -1, 2) rep3(j, -1, 2) {
        if ((i | j) == 0) continue;
        int ny = y + i;
        int nx = x + j;
        if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
        if (reached[ny][nx] == 1 || c[ny][nx] == 0) continue;
        reached[ny][nx] = 1;
        dfs(ny, nx);
    }
}
int main() {
    while (cin >> w && w) {
        cin >> h;
        fill_n(*reached, 50 * 50, 0);
        rep(i, h) rep(j, w) cin >> c[i][j];
        cnt = 0;
        rep(i, h) rep(j, w) {
            if (c[i][j] == 0 || reached[i][j] == 1) continue;
            reached[i][j] = 1;
            cnt++;
            dfs(i, j);
            // rep(k, h) { rep(l, w) cout << reached[k][l] << " "; cout << endl; }
        }
        out(cnt);
    }
}

C++: #include<iostream>

using namespace std;

int map[50][50];
int h,w;
int dx[]={-1,0,1},dy[]={-1,0,1};
void loop(int ,int );
int main(){
	int cnt=0;
	while(cin>>h>>w,h){
		for(int i=0;i<w;i++){
			for(int j=0;j<h;j++){
				cin>>map[i][j];
			}
		}
		for(int i=0;i<w;i++){
			for(int j=0;j<h;j++){
				if(map[i][j]==1){
					loop(i,j);	
					cnt++;	
				}
			}
		}
		cout<<cnt<<endl;
		for(int i=0;i<w;i++){
			for(int j=0;j<h;j++){
				map[i][j]=0;
			}
		}
	}
	return 0;
}
void loop(int x,int y){
	map[x][y]=0;
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			if(map[x+dx[i]][y+dy[j]]==1){
				loop(x+dx[i],y+dy[j]);
			}
		}
	}
	return ;
}