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>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>


using namespace std;

typedef long long ll;

typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<ll> vll;

typedef pair<int, int> pii;

typedef queue<int> qi;
typedef queue<string> qs;


#define rep(i, n) for(int i=0; i<(n); ++i)
#define repp(i, a, b) for(int i = (a); i <= (b); i++)
#define Rep(i, n) for(int i=n; i >= 0; i--)

#define all(v) v.begin(), v.end()
//sort( all(v) )　などと使える

using field = vector<vector<int>>;

field c;

int w, h;

void dfs(field &c, int x, int y) {

	c[x][y] = 0;
	

	for (int dx = -1; dx <= 1; dx++) for (int dy = -1; dy <= 1; dy++) {
		int nx = x + dx, ny = y + dy;

		if (nx == x && ny == y) continue;

		else if (nx >= 0 && nx < h && ny >= 0 && ny < w && c[nx][ny] == 1) dfs(c, nx, ny);

	}
}


int main(void){
	

	while (cin >>w >> h) {		

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

		c.assign(h, vector<int>(w));

		rep(i, h) rep(j, w) cin >> c[i][j];

		int cnt = 0;

		rep(i, h) rep(j, w) {
			if (c[i][j] == 1) {
				dfs(c, i, j);
				cnt++;
			}
		}

		cout << cnt << endl;
	}
}

C++: #include <iostream>

using namespace std;

#define MAX_H 55
#define MAX_W 55

int W, H;

int C[MAX_H][MAX_W];

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

void dfs(int x, int y)
{
	if (C[y][x] == 1)
	{
		C[y][x] = 0;

		for (int i = 0; i < 8; i++)
		{
			if (0 <= x + dx[i] && x + dx[i] <= W - 1 && 0 <= y + dy[i] && y + dy[i] <= H - 1)
			{
				if (C[y + dy[i]][x + dx[i]] == 1)
				{
					dfs(x + dx[i], y + dy[i]);
				}
			}
		}
	}
}

int main()
{
	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 >> 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(j, i);

					count++;
				}
			}
		}

		cout << count << endl;
	}

	return 0;
}

C++: #include <cstdio>
#define f(n)for(int i=0;i<n;i++)
#define s(w)scanf("%d",&w)
int a,n,m,d[99][99];
int u[16]={-1,-1,-1,0,0,1,1,1,-1,0,1,-1,1,-1,0,1};
void k(int x,int y){
	if(d[x][y]){f(8)k(x+u[i],y+u[i+8]);d[x][y]=0;}
}
int main(){
	a=0;
	s(n);s(m);
	f(n*m)s(d[i/n][i%n]);
	f(n*m)if(d[i/n][i%n])a++,k(i/n,i%n);
	printf("%d\n",a);
	main();
}

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;
}

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

int h,w;
int mas[60][60];

void solve(int x,int y){
  for(int i=-1;i<=1;i++){
    for(int j=-1;j<=1;j++){
      int nx = x + i;
      int ny = y + j;
      if(nx >= 0 && ny >= 0 && nx < w && ny < h && mas[ny][nx] == 1){
	mas[ny][nx] = 0;
	solve(nx,ny);
      }
    }
  }
  return;
}

int main(){
  while(cin >> w >> h , w){
    int cnt = 0;
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	cin >> mas[i][j];
      }
    }
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	if(mas[i][j] == 1){
	  mas[i][j] = 0;
	  solve(j,i);
	  cnt++;
	}
      }
    }
    cout << cnt << endl;
  }
}

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

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl

using namespace std;

typedef long long int ll;

template<typename T>
vector<T> make_v(size_t a, T b) {
    return vector<T>(a, b);
}

template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

void dfs(int y, int x, vector<vector<bool>> &used, vector<vector<int>> &M) {
    if (used[y][x]) return;
    used[y][x] = true;
    REP(i, -1, 2) {
        REP(j, -1, 2) {
            int ny = y + i, nx = x + j;
            if (ny < 0 || ny >= M.size() || nx < 0 || nx >= M[ny].size() || M[ny][nx] == 0) continue;
            dfs(ny, nx, used, M);
        }
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int w, h;
    while (cin >> w >> h, w + h) {
        auto M = make_v(h, w, 0);
        REP(i, 0, h) {
            REP(j, 0, w) {
                cin >> M[i][j];
            }
        }
        auto used = make_v(h, w, false);
        int ans = 0;
        REP(i, 0, h) {
            REP(j, 0, w) {
                if (!used[i][j] && M[i][j] == 1) {
                    dfs(i, j, used, M);
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }

    return 0;
}

C++: //41
#include<iostream>

using namespace std;

int w,h;
bool imap[50][50];

void ff(int y,int x){
  imap[y][x]=false;
  for(int i=-1;i<=1;i++){
    for(int j=-1;j<=1;j++){
      if(imap[y+i][x+j]){
	ff(y+i,x+j);
      }
    }
  }
}

int main(){
  for(;cin>>w>>h,w|h;){
    fill_n(&imap[0][0],50*50,false);
    for(int y=0;y<h;y++){
      for(int x=0;x<w;x++){
	cin>>imap[y][x];
      }
    }
    int ans=0;
    for(int y=0;y<h;y++){
      for(int x=0;x<w;x++){
	if(imap[y][x]){
	  ans++;
	  ff(y,x);
	}
      }
    }
    cout<<ans<<endl;
  }
  return 0;
}