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;
using ll = long long;

int w, h;
vector<vector<bool>> mp;


vector<pair<int,int>> dir{{0,1},{1,0},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};

void dfs(int y, int x)
{
    for(auto i : dir){
        if(mp[y + i.first][x + i.second]){
            mp[y + i.first][x + i.second] = false;
            dfs(y + i.first, x + i.second);
        }
    }
}


int main()
{
    vector<int> AS;
    while(1){
        cin >> w >> h;
        if(!w && !h)break;
        mp.resize(h + 2,vector<bool>(w + 2));
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                int t; cin >> t;
                mp[i][j] = t;
            }
        }

        int ans = 0;
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                if(mp[i][j]){
                    mp[i][j] = false;
                    dfs(i, j);
                    ans++;
                }
            }
        }
        AS.push_back(ans);
    }
    for(auto i : AS)cout << i << endl;
}

C++: #include<cmath>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdio>
#include<map>
#include<utility>
#include<list>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int dX[8] = { 0, 1, 1, 1, 0, -1, -1, -1 }, dY[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
struct XY
{
	int x;
	int y;
};


/*
(char)'1' - (int)48 = (int)1;


*/
int main()
{
	int h, w;
	cin >> w>> h;
	while (w != 0 || h != 0)
	{
		queue<XY> m;
		int a[200][200] = {};
		for (int i = 0; i < h; i++)
		{
			for (int l = 0; l < w; l++)
			{
				cin >> a[i + 1][l + 1];
			}
		}


		int ans = 0;

		for (int i = 0; i <= h; i++)
		{
			for (int l = 0; l <= w; l++)
			{
				if (a[i][l] == 1)
				{
					ans++;
					XY now;
					now.x = l;
					now.y = i;
					m.push(now);
					while (!m.empty())
					{
						XY gg;
						int x, y;
						x = m.front().x;
						y = m.front().y;
						m.pop();

						for (int i = 0; i < 8; i++)
						{
							if (a[y + dY[i]][x + dX[i]] == 1)
							{
								a[y + dY[i]][x + dX[i]] = 0;
								gg.x = x + dX[i];
								gg.y = y + dY[i];
								m.push(gg);
							}
						}

					}
				}
			}
		}
		cout << ans << endl;
		cin >> w >> h;
	}
}

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

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

void f(int x, int y){
	sea[x][y] = '0';
	for(int i = 0;i < 8;i++){
		int nx = x + dx[i], ny = y + dy[i];
		if(nx>=0 and nx<h and ny>=0 and ny<w and sea[nx][ny]=='1'){
			// cout << nx << " " << ny << endl;
			f(nx, ny);
		}
	}
	return;
}

int main(){
	while(1){
		cin >> w >> h;
		if(w == 0 and h == 0) break;
		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j) cin >> sea[i][j];
		}

		int ans = 0;

		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j){
				if(sea[i][j] == '1'){
					// cout << i << j << endl;
					ans++;
					f(i, j);
				}
			}
		}

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

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

using namespace std;

int m[50][50]={};
int w,h;
int cnt;

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

void fanc(int y,int x){
	m[y][x]=0;
	int ny,nx;
	for(int i=0;i<8;i++){
		ny = y+dy[i];
		nx = x+dx[i];
		if(ny>=0&&nx>=0&&ny<h&&nx<w&&m[ny][nx]==1){
			fanc(ny,nx);
		}
	}
}

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;

struct Point {
	int x,y;
};

bool map[50][50];
const int dx[8] = {1,1,0,-1,-1,-1,0,1};
const int dy[8] = {0,1,1,1,0,-1,-1,-1};
int w,h;

void bfs(int x,int y) {

	queue<Point> q;
	Point p,p2;
	p.x = x;
	p.y = y;

	q.push(p);
	map[p.x][p.y] = false;
	while(!q.empty()) {
		p = q.front();
		q.pop();

		for(int i = 0;i < 8;i++) {
			p2.x = p.x + dx[i];
			p2.y = p.y + dy[i];

			if(p2.x < 0 || p2.x >= w) continue;
			if(p2.y < 0 || p2.y >= h) continue;

			if(map[p2.x][p2.y]) {
				q.push(p2);
				map[p2.x][p2.y] = false;
			}
		}
	}
}

int main() {

	while(cin >> w >> h && !(w == 0 && h == 0)) {
		for(int y = 0;y < h;y++) {
			for(int x = 0;x < w;x++) cin >> map[x][y];
		}
		int ct = 0;
		for(int y = 0;y < h;y++) {
			for(int x = 0;x < w;x++) {
				if(map[x][y]) {
					ct++;
					bfs(x,y);
				}
			}
		}
		cout << ct << endl;
	}

}

C++: #include <iostream>
#include <vector>

using namespace std;

void solve(vector<vector<int> >& C, int cur_x, int cur_y) {
  C[cur_y][cur_x] = 0;
  for (int i = -1; i < 2; ++i) {
    for (int j = -1; j < 2; ++j) {
      int next_x = cur_x + j;
      int next_y = cur_y + i;
      if (next_x >= 0 && next_x < C[0].size() && next_y >= 0 && next_y < C.size()) {
        if (C[next_y][next_x] == 1)
          solve(C, next_x, next_y);
      }
    }
  }
}


int main(int argc, char* argv[]) {
  vector<int> rets;
  while (true) {
    int w, h;
    cin >> w >> h;

    if (w == 0 && h == 0)
      break;

    vector<vector<int> > C(h);
    for (int i = 0; i < h; ++i) {
      C[i].resize(w);
      for (int j = 0; j < w; ++j) {
        cin >> C[i][j];
      }
    }

    int ret = 0;
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w; ++j) {
        if (C[i][j] == 1) {
          ++ret;
          solve(C, j, i);
        }
      }
    }

    rets.push_back(ret);
  }

  for (int i = 0; i < rets.size(); ++i)
    cout << rets[i] << endl;

  return 0;
}

C++: #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;

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

void dfs(int y, int x){
	c[y][x] = 0;
	for(int i = 0; i < 8; i++){
		int ny = y + dy[i], nx = x + dx[i];
		if(0<=ny and ny<h and 0<=nx and nx<w and c[ny][nx]==1){
			dfs(ny, nx);
		}
	}
}

int solve(){
	int res = 0;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(c[i][j] == 1){
				dfs(i, j);
				res++;
			}
		}
	}

	return res;
}

int main(void){
	while(scanf("%d%d", &w, &h) != EOF){
		if(w == 0 and h == 0) break;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				scanf("%d", &(c[i][j]));
			}
		}
		printf("%d\n", solve());
	}

	return 0;
}