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 <bits/stdc++.h>
using namespace std;

vector<vector<bool>> seen;
int H, W;
int d_h[8] = {1,1,1,0,0,-1,-1,-1};
int d_w[8] = {1,0,-1,1,-1,1,0,-1};

void dfs(const vector<vector<int>> &m, int h, int w){
    seen[h][w] = true;

    //cout << h << ' ' << w <<  ' ' << m[h][w] << endl;
    
    for(int i = 0; i < 8; i++){
        if(1 <= h+d_h[i] && h+d_h[i] <= H && 1 <= w+d_w[i] && w+d_w[i] <= W && (!seen[h+d_h[i]][w+d_w[i]]) && m[h+d_h[i]][w+d_w[i]] == 1){
            dfs(m, h+d_h[i], w+d_w[i]);
        }
    }
}

int main(){
    while(1){
        cin >> W >> H;
        seen.assign(H+1, vector<bool>(W+1, false));
        if(H == 0 && W == 0) break;
        vector<vector<int>> m(H+1, vector<int>(W+1,0));
        for(int i = 1; i <= H; i++){
            for(int j = 1; j <= W; j++){
                cin >> m[i][j];
            }
        }

        int cnt = 0;
        for(int i = 1; i <= H; i++){
            for(int j = 1; j <= W; j++){
                if(!seen[i][j] && m[i][j] == 1) {
                    //cout << i << ' ' << j << endl;
                    cnt++;
                    dfs(m, i, j);
                }
            }
        }
        cout << cnt << endl;
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(pair<int, int> a, pair<int, int> b) {
    if(a.first != b.first){
        return a.first < b.first;
        
    }else{
        return a.second < b.second;
    }
}
// 入力

vector<vector<ll> > G;
vector<bool> seen;


//ll fcnt=1;
void dfs(ll v){
    seen[v] = 1;

    rep(i,G[v].size()){
        if(seen[G[v][i]] == 0){
            dfs(G[v][i]);
        }
    }

}

int main() {
    
    while(1){
        G.clear();
        seen.clear();
        ll w,h;
    
        cin >> w>>h;
        if(w==0 &&h==0) break;
        ll cnt=1;
        map<pair<ll,ll>,ll> m;
        
        rep(i,h){
            rep(j,w){
                bool c;
                cin >>c;
                if(c){
                    m[mp(i,j)] = cnt;
                    cnt++;
                }
            }
        }
        G.resize(cnt);
        seen.resize(cnt);


        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(m[mp(i-1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j-1)]);
                    }
                    if(m[mp(i,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j-1)]);
                    }
                    if(m[mp(i-1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j)]);
                    }
                    if(m[mp(i,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j+1)]);
                    }
                    if(m[mp(i+1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j)]);
                    }
                    if(m[mp(i+1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j-1)]);
                    }
                    if(m[mp(i-1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j+1)]);
                    }
                    if(m[mp(i+1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j+1)]);
                    }

                }
            }
        }
        /*rep(i,G.size()){
            rep(j,G[i].size()){
                cout << G[i][j];
            }
            cout << endl;
        }*/

        /*rep(i,h){
            rep(j,w){
                cout << m[mp(i,j)]<< " ";
            }
            cout << endl;
        }*/
        ll ans = 0;
        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(seen[m[mp(i,j)]] == 0){
                        dfs(m[mp(i,j)]);
                        ans++;
                    }
                }
            }
        }
        

        cout<<ans<<endl;
    }
    return 0;
    

}

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

#define rep(i, n) for(auto i=0; i != n; ++i)
#define REP(i, k, n) for(auto i=k; i != n; ++i)
#define rrep(i, n) for(auto i=n; i != 0; --i)
#define RREP(i, n, k) for(auto i=n; i != k; --i)


int sea[60][60];
int w,h;
void dfs(int x, int y){
    int dx[] = {0, 1, -1};
    int dy[] = {0, 1, -1};

    if(sea[x][y] == -1) return ;

    if(sea[x][y] == 1){
        sea[x][y] = -1;
    }

    for(int xx=-1; xx<=1; xx++){
        for(int yy=-1; yy<=1; yy++){
            if(xx==0 && yy==0){
                continue;
            }

            if(sea[x + xx][y + yy] == 1){
                dfs(x+xx, y+yy);

            }

        }
    }



}

int main (){
    while (true){
        cin>>w>>h;
        if(w==0 && h==0){ break;}
        rep(i, 60){
            rep(j,60){
                sea[i][j] = -1;
            }
        }

        rep(i, h){
            rep(j,w){
                cin>>sea[i+1][j+1];
            }
        }


        int ans = 0;
        rep(i, h){
            rep(j,w){
                if(sea[i+1][j+1] == 1){
                    dfs(i+1,j+1);
                    ans++;
                }
            }
        }

        cout<<ans<<endl;

    }

}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int w, h;

void dfs(int x, int y, vector<vector<int>> &c) {
  if (x < 0 || y < 0 || x >= h || y >= w) {
    return;
  }
  if (c[x][y] == 0) {
    return;  // umi or seeen
  }
  c[x][y] = 0;

  for (int i = 0; i < 8; i++) {
    dfs(x + dx[i], y + dy[i], c);
  }
}
int main() {
  vector<int> ans;
  while (1) {
    cin >> w >> h;
    if (w == 0 && h == 0) {
      break;
    }
    vector<vector<int>> c(h, vector<int>(w));

    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        cin >> c[i][j];
      }
    }
    int count = 0;
    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        if (c[i][j] == 1) {
          dfs(i, j, c);
          count++;
        }
      }
    }
    ans.push_back(count);
  }
  for (auto it = ans.begin(); it != ans.end(); it++) {
    cout << *it << endl;
  }
}