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

Python: import sys
sys.setrecursionlimit(10**7)
def dfs_rec():
    W,H = list(map(int,input().split()))
    if W == 0 and H == 0:
        exit()
    C = [list(map(int,input().split())) for _ in range(H)]
    D = [[0,1],[0,-1],[1,0],[1,1],[1,-1],[-1,0],[-1,1],[-1,-1]]
    
    def dfs(C, x, y):
        C[y][x] = 2
        for d in D:
            if x+d[0] < 0 or x+d[0] > W-1 or y+d[1] < 0 or y+d[1] > H-1:
                continue
            if C[y+d[1]][x+d[0]] == 0 or C[y+d[1]][x+d[0]] == 2:
                continue
            dfs(C, x+d[0], y+d[1])
    
    count = 0
    for w in range(W):
        for h in range(H):
            if C[h][w] == 0 or C[h][w] == 2:
                continue
            dfs(C, w, h)
            count += 1
    
    print(count)

while True:
    dfs_rec()

Python: from sys import stdin
import sys
sys.setrecursionlimit(10000)


def grid2adj(arr_grid,direction=4):
    def cand(i,j,direction):
        if direction == 4:
            return [[i-1,j],[i+1,j],[i,j-1],[i,j+1]]
        elif direction == 8:
            return [[i-1,j],[i+1,j],[i,j-1],[i,j+1],
                    [i-1,j-1],[i-1,j+1],[i+1,j-1],[i+1,j+1]]
        else:
            print('Error')
    
    M,N = len(arr_grid),len(arr_grid[0])
    arr_con = [[] for i in range(M*N)]
    for i in range(M):
        for j in range(N):
            v = i*N+j
            for _cand in cand(i,j,direction):
                if 0<=_cand[0]<M and 0<=_cand[1]<N:
                    next_v = _cand[0]*N+_cand[1]
                    arr_con[v].append(next_v)
    arr_val = sum(arr_grid,[])

    return arr_con, arr_val


class DFS():
    def __init__(self, con, val):
        # 隣接リスト表現
        self.con = con
        self.val = val
        self.N = len(self.con)
        # 訪問済み?
        self.seen = [False] * self.N

    def dfs(self, v):
        self.seen[v] = True
        for next_v in self.con[v]:
            if self.seen[next_v]:
                continue
            if self.val[next_v] == 1:
                self.dfs(next_v)
        return


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    io_cnt = 0
    while True:
        try:
            w,h = list(map(int,_in[io_cnt].split(' ')))  # type:list(int)
            c_arr = []
            for i in range(h):
                _ = list(map(int,_in[io_cnt+i+1].split(' ')))  # type:list(int)
                c_arr.append(_)
            io_cnt += h+1
            # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
            c_con, c_val = grid2adj(c_arr,direction=8)
            dfs = DFS(c_con,c_val)

            cnt = 0
            for v, val in enumerate(c_val):
                if val == 1:
                    if not dfs.seen[v]:
                        dfs.dfs(v)
                        cnt += 1
            # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
            print(cnt)
        except:
            break

Python: # -*- coding: utf-8 -*-
#150 島は幾つある？
h,w=1,1

count=0
anser=0

def search(x,y):
    #マップの外側か壁の場合は何もしない
    #print(x,y)

    global count
    count+=1
    if x<0 or x>w-1 or y<0 or y>h-1 or map_data[y][x]==0:
 
        return
        
    
    #以前に到達していたら何もしない
    if reached[y][x] ==0:
         return

    reached[y][x]=0
    
    #print("aa")



    search(x+1,y)#右
    search(x-1,y)#左
    search(x,y+1)#上
    search(x,y-1)#下
    search(x-1,y-1)
    search(x-1,y+1)
    search(x+1,y-1)
    search(x+1,y+1)


while h!=0 and w!=0: 
    anser=0
    count=1
    #グラフの入力方法------

    w,h=map(int ,raw_input().split())
    if h==0 and w==0:
        break

    map_data = [[0]*w for _ in range(h)]
    reached = [[1]*w for _ in range(h)]

    for i in range(h):
        ct = raw_input().split()
       
        for j in range(w):
            map_data[i][j] = int(ct[j])
            reached [i][j]=int(ct[j])
            if ct[j]==1:
                sx=j
                sy=i

    t=0
    a=0
    while a<=h:
       if 1 in reached[t%h]:         
            search(reached[t%h].index(1),t%h)
            anser+=1
            #print("count",count)
            count=1
            a=0
       elif count==h:
                break
       t+=1
       a+=1

    print(anser)

Python: 
global moved

nxt = [[0, 1], [1, 0], [0, -1], [-1, 0], [-1, -1], [1, 1], [-1, 1], [1, -1]]
def search(now_j, now_i):
  now =[[now_j,now_i]]
  while now:
    temp = []
    for k in now:
      #print(k)
      for a, b in nxt:
        #print(k, b, a)
        #print([k[0]+a, k[1]+b] )
        #print(k[0]+a < 0 , k[1]+b < 0 , k[0]+a >= w , k[1]+b >= h , [k[0]+a, k[1]+b] in moved)
        if k[0]+a < 0 or k[1]+b < 0 or k[0]+a >= h or k[1]+b >= w or [k[0]+a, k[1]+b] in moved:
          continue
        elif li[k[0]+a][k[1]+b] == 1:
 
          temp.append([k[0]+a, k[1]+b])
          moved.append([k[0]+a, k[1]+b])
    now = temp
ans_li = []

while 1:
  w, h= map(int, input().split())
  if w == 0 and h == 0:
    break
  li = [list(map(int, input().split())) for _ in range(h)]
  moved = []
  ans = 0

  for i in range(w):
    for j in range(h):
      if [j, i] not in moved and li[j][i] == 1:
        moved.append([j, i])
        #print(moved,j, i)
        search(j, i)  
        
        ans+=1
  ans_li.append(ans)

for i in ans_li:
  print(i)

Python: #!python
# -*- coding: utf-8 -*-

import sys

sys.setswitchinterval(10**8)


next_s = ((-1, 1), (0, 1), (1, 1),
          (-1, 0), (1, 0),
          (-1, -1), (0, -1), (1, -1))


def DFS(x, y):
    if not (0 <= x < W and 0 <= y < H):
        return
    if not map_[y * W + x]:
        return

    map_[y * W + x] = 0

    for dx, dy in next_s:
        DFS(x + dx, y + dy)


while True:
    W, H = map(int, input().split())
    if W == 0 and H == 0:
        break

    map_ = []
    for h in range(H):
        map_ += list(map(int, input().split()))
    # print(map_)
    island_num = 0
    while any(map_):
        next_idx = map_.index(1)
        x = next_idx % W
        y = next_idx // W
        # print(map_)
        # print("x: {} | y: {}".format(x, y))
        DFS(x, y)
        island_num += 1

    print(island_num)

Python: import collections,itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
while 1:
    w,h = LI()
    if w==h==0:
        break
    ans = 0
    c = [LI() for _ in range(h)]
    seen = [[0]*w for _ in range(h)]
    stack = []
    dhdw = [[-1,-1],[-1,0],[-1,1],[0,-1],[0,1],[1,-1],[1,0],[1,1]]
    def dfs(H,W):
        seen[H][W] = 1
        stack.append([H,W])
        while stack:
            sh,sw = stack.pop()
            for dh,dw in dhdw:
                nh,nw = sh+dh,sw+dw
                if not(0<=nh<=h-1) or not(0<=nw<=w-1) or seen[nh][nw] or c[nh][nw]==0:
                    continue
                seen[nh][nw] = 1
                stack.append([nh,nw])
    for H,W in itertools.product(range(h),range(w)):
        if seen[H][W] or c[H][W]==0:
            continue
        ans += 1
        dfs(H,W)
    print(ans)