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 <algorithm>
#include<iostream>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<string>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;

long mapp[51][51];
bool seen[51][51];
int W,H;

// 八方向への移動ベクトル
const int dx[8] = {1, 0, -1, 0, -1, 1 ,-1, 1};
const int dy[8] = {0, 1, 0, -1, -1,-1 , 1, 1};

void dfs(int w,int h){

  seen[h][w] = true;
  int ii,jj;
  int nx,ny;

  for(ii=0;ii<8;ii++){

    nx = w + dx[ii];
    ny = h + dy[ii];

    if(nx < 0 || ny < 0 || nx >= W || ny >= H){continue;}
    if(mapp[ny][nx] == 0){continue;}
    if(seen[ny][nx] == true){continue;}

    //cout << "H:" << H << "W:" << W << "nx:" << nx << "ny:" << ny << endl;
    dfs(nx,ny);
  }

  
}

int main(){

  long ii,jj,kk;
  vector<int> ret;


  while(true){
    cin >> W >> H;
    //cout << "W:" << W << "H:" << H <<endl;
    if(W == 0){
      break;
    }
    memset(mapp,0,sizeof(mapp));    
    for(ii=0;ii<H;ii++){
      for(jj=0;jj<W;jj++){
        cin >> mapp[ii][jj];
      }
    }

    memset(seen,0,sizeof(seen));

    int cnt=0;

    for(ii=0;ii<H;ii++){
      for(jj=0;jj<W;jj++){

        //cout << "ii:" << ii << "jj:" << jj << endl;
        if(mapp[ii][jj] == 1 && seen[ii][jj] == false){
          //cout << "ii:" << ii << "jj:" << jj << endl;
          dfs(jj,ii);
          cnt++;
        }
      }
    }

    cout << cnt << endl;
  }
  
  return 0;
}

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

using namespace std;

void dfs(vector<vector<int> >& map, int y, int x, int H, int W, int index)
{
  int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
  int dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};

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

int main()
{
  int W,H;
  int index = 2;
  while(1){
    cin >> W >> H;
    if(W == 0 && H == 0){
      break;
    }
    vector<vector<int> > map(H, vector<int>(W, 0));
    for (int i = 0; i < H; i++)
    {
      for (int j = 0; j < W;j++){
        cin >> map[i].at(j);
      }
    }
    for (int i = 0; i < H;i++){
      for (int j = 0; j < W;j++){
        if(map[i][j] == 1){
          dfs(map, i, j, H, W, index);
          index++;
        }
      }
    }

    cout << index - 2 << endl;
    index = 2;
    map.clear();
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <algorithm>
#include <stack>
using namespace std;
int grid[51][51];
int w, h, ans;
void dfs(int i, int j){ //iが縦jが横
    if(i<0||j<0||grid[i][j]==0) return ;
    grid[i][j]=0;
    
    for(int n=-1; n<=1; ++n){
        for(int m=-1; m<=1; ++m){
            dfs(i+n, j+m);
        }
    }
    return ;
}
int main() {
    while(cin >> w >> h, w||h){
        
        for(int i=0; i<h; ++i){
            for(int j=0; j<w; ++j){
                cin >> grid[i][j];
            }
        }
        ans = 0;
        for(int i=0; i<h; ++i){
            for(int j=0; j<w; ++j){
                if(grid[i][j]==1){
                    dfs(i, j);
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
        
    return 0;
}

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

vector<vector<int>> mp;

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

void dfs(int x, int y, int hight, int width){
   mp[x][y] = 0;
  
  for(int k = 0; k < 8; k++){
    int a = x+dx[k]; int b = y+dy[k];
    if( a < 0 || a >= hight || b < 0 || b >= width){ continue;}
    if( mp[a][b] == 0){ continue;}
    else if(mp[a][b] == 1){
   dfs(a,b ,hight,width);}}
  return  ;
}
  
  
int main(){

 int w,h;
  while( cin >> w >> h){
    if( w == 0 && h == 0){ break;}
    
    mp = vector<vector<int>> (h,vector<int>(w));
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){ cin >> mp[i][j];}}
    
    //reserching the number of rikuchi by using dfs method
    int ans = 0;
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
        if(mp[i][j]==0){ continue;}
        dfs(i,j,h,w); 
        ans++;
      }
    }
    
    
    cout << ans << endl;
  }
  
  return 0;}

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

int state[100][100];
bool reached[100][100];
int w,h;

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

void dfs(int x, int y) {

	if(x==0 || h<x || y==0 || w<y || state[x][y] == 0)
		return;
	if(reached[x][y] == true)
		return;

	reached[x][y]=true;

	for(int i=0; i<8; i++) {
		dfs(x+dx[i],y+dy[i]);
	}
}

int main() {

	while(1){
		cin >> w >> h;
		if(w==0 && h==0) {
			return 0;
		}
		memset(state, 0, sizeof(state));
		memset(reached, false, sizeof(reached));
		for(int i=1; i<=h; i++) {
			for(int j=1; j<=w; j++) {
				cin >> state[i][j];
			}
		}
		int count=0;
		for(int i=1; i<=h; i++) {
			for(int j=1; j<=w; j++) {
				if(reached[i][j]==true || state[i][j] == 0)
					continue;
				else{
					dfs(i,j);
					count++;
				}
			}
		}
		cout << count << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int W,H;
int t[50][50];
void visit(int h,int w){
  t[h][w]=0;
  for(int nh=h-1;nh<h+2;nh++){
    for(int nw=w-1;nw<w+2;nw++){
      if(t[nh][nw]==1&&0<=nh&&0<=nw&&nh<H&&nw<W)visit(nh,nw);
    }
  }
}

int main(void){
  int a,b,c,n;
  while(1){
    cin>>W>>H;
    c=0;
    if(W==0&&H==0)break;
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	cin>>t[i][j];
      }
    }
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	if(t[i][j]==1){
	  c++;
	  visit(i,j);
	}
      }
    }
    cout<<c<<endl;
  }
}

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

using ll=long long;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)

int read(){
	int i;
	scanf("%lld",&i);
	return i;
}

int land[100][100]={0};
int dy[]={-1,-1,-1,0,0,1,1,1};
int dx[]={-1,0,1,-1,1,-1,0,1};
int cnt=0;

void isLand(int i,int j){
    if(land[i][j]==1){
    	land[i][j] = 0;
		REP(k,8){
			int newy=i+dy[k];
			int newx=j+dx[k];
			isLand(newy,newx);
		}
    }
}

signed main(){
	int w,h;
	while( w=read(),h=read(),w||h){
		cnt=0;
		
		REP(i,100){
			REP(j,100){
				land[i][j]=0;
			}
		}
		FOR(i,1,h+1){
			FOR(j,1,w+1){
				land[i][j]=read();
			}
		}
		
		FOR(i,1,h+1){
			FOR(j,1,w+1){
				if(land[i][j]==1){
					cnt++;
					isLand(i,j);
				}
			}
		}
		
		cout << cnt << endl;
	}
	
}