Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Moore Neighbourhood by Anna_Barys
def count_neighbours(grid, row, col):
sum =0
if row-1 < 0:
pr = 0
else:
pr = row-1
if row+1 > len(grid)-1:
kr = len(grid)-1
else:
kr = row+1
if col-1 < 0:
pc = 0
else:
pc = col-1
if col+1 > len(grid[0])-1:
kc = len(grid[0])-1
else:
kc = col+1
for i in range(pr, kr+1):
for j in range(pc, kc+1):
print(i,j)
x = grid[i]
y = x[j]
sum = sum + y
pole = grid[row][col]
sum = sum - pole
return sum
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 1, 2) == 3, "1st example"
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 0, 0) == 1, "2nd example"
assert count_neighbours(((1, 1, 1),
(1, 1, 1),
(1, 1, 1),), 0, 2) == 3, "Dense corner"
assert count_neighbours(((0, 0, 0),
(0, 1, 0),
(0, 0, 0),), 1, 1) == 0, "Single"
Jan. 1, 2016
