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: from itertools import product
import sys

sys.setrecursionlimit(10 ** 6)

def solve(H, W, C):
    def dfs(h, w):
        if h < 0 or h >= H or w < 0 or w >= W:
            return 0
        elif C[h][w] == 0:
            return 0
        else:
            C[h][w] = 0
            for dh, dw in product((1, 0, -1), repeat = 2):
                dfs(h+dh, w+dw)
            return 1
    
    cnt = 0

    for h in range(H):
        for w in range(W):
            cnt += dfs(h, w)

    print(cnt)

A = []
while True:
    W, H = [int(i) for i in input().split()]
    if W == 0 and H == 0:
        break
    else:
        C = [[int(i) for i in input().split()] for j in range(H)]
        A.append((H, W, C))

for a in A:
    solve(*a)

Python: import sys
sys.setrecursionlimit(10 ** 7)
def dfs(h, w, grid):
    grid[h][w] = 0

    # 八方向を探索
    for dh in range(-1, 2):
        for dw in range(-1, 2):
            nh = dh + h
            nw = dw + w

            # 場外だった場合はするー(番兵)
            if nh < 0 or nw < 0:
                continue
            if grid[nh][nw] == 0:
                continue
            # 次に進む
            dfs(nh, nw, grid)
while True:
    grid = []
    W, H = map(int, input().split())
    if W == 0 and H == 0:
        break
    grid.append([0] * (W+2))
    grid += [[0] + list(map(int, input().split())) + [0] for _ in range(H)]
    grid.append([0] * (W+2))

    cnt = 0
    for h in range(1, H+1):
        for w in range(1, W+1):
            if grid[h][w] == 0:
                continue
            dfs(h, w, grid)
            cnt += 1
    print(cnt)

Python: 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: from collections import deque
import sys
input = sys.stdin.readline

w = []
h = []
dataset = []
while True:
    wt, ht = map(int, input().split())
    if wt==0 and ht==0:
        break
    w.append(wt)
    h.append(ht)
    subset = [[0]*(wt+2) for _ in range(ht+2)]
    for i in range(1, ht + 1):
        inls = [0] + list(map(int, input().split())) + [0]
        for j in range(1, wt + 1):
            subset[i][j] = inls[j]
    dataset.append(subset)

for i in range(len(dataset)):
    subset = dataset[i]
    w_ = w[i]
    h_ = h[i]
    idxs = []
    for row in range(1, h_+1):
        for col in range(1, w_+1):
            if subset[row][col] == 1:
                idxs.append((row, col))
    
    graph = {idx: deque() for idx in idxs}
    for idx in idxs:
        x = idx[0]
        y = idx[1]
        surroundings = [(x+1, y), (x+1, y+1), (x, y+1), (x-1, y+1)
                         ,(x-1, y), (x-1, y-1), (x, y-1), (x+1, y-1)]
        for surrounding in surroundings:
            if subset[surrounding[0]][surrounding[1]] == 1:
                graph[idx].append(surrounding)
    
    seen = [[0]*(w_+2) for _ in range(h_+2)]
    stack = []
    def dfs(idx):
        seen[idx[0]][idx[1]] = 1
        stack.append(idx)
        while stack:
            s = stack[-1]
            if not graph[s]:
                stack.pop()
                continue
            
            g = graph[s].popleft()
            if seen[g[0]][g[1]]:
                continue
            seen[g[0]][g[1]] = 1
            stack.append(g)

    island_count = 0
    for idx in idxs:
        if not seen[idx[0]][idx[1]]:
            dfs(idx)
            island_count += 1
    print(island_count)

Python: import sys

sys.setrecursionlimit(3000)

while True:

    w, h = map(int, input().split())

    if w == 0 and h == 0:
        exit() 

    C = []
    for i in range(h):
        c = list(map(int, input().split()))
        C.append(c)

    def is_island(i, j):
        if 0 <= i < h and 0 <= j < w and C[i][j] == 1:
            C[i][j] = 0
            return True
        else:
            return False

    def walk_to(i, j):
        if is_island(i - 1, j):
            walk_to(i - 1, j)
        if is_island(i - 1, j - 1):
            walk_to(i - 1, j - 1)
        if is_island(i, j - 1):
            walk_to(i, j - 1)
        if is_island(i + 1, j - 1):
            walk_to(i + 1, j - 1)
        if is_island(i + 1, j):
            walk_to(i + 1, j)
        if is_island(i + 1, j + 1):
            walk_to(i + 1, j + 1)
        if is_island(i, j + 1):
            walk_to(i, j + 1)
        if is_island(i - 1, j + 1):
            walk_to(i - 1, j + 1)

    count = 0        
    for i in range(h):
        for j in range(w):
            if is_island(i, j):
                count = count + 1
                walk_to(i, j)

    print(count)

Python: import sys

sys.setrecursionlimit(10000)


dx = [0, 1, 0, -1, 1, 1, -1, -1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]


def dfs(field, w, h, height, width):
    field[height][width] = 0

    for i in range(8):
        nw = width + dx[i]
        nh = height + dy[i]

        if nw < 0 or nw >= w or nh < 0 or nh >= h:
            continue
        if field[nh][nw] == 0:
            continue

        dfs(field, w, h, nh, nw)
    return


def solve():
    ans = []
    while True:
        w, h = map(int, input().split())
        if w == h == 0:
            break

        field = [list(map(int, input().split())) for _ in range(h)]
        count = 0
        for c in range(h):
            for r in range(w):
                if field[c][r] == 1:
                    count += 1
                    dfs(field, w, h, c, r)

        ans.append(count)
    print(*ans, sep="\n")


if __name__ == "__main__":
    solve()