Advertisement
MaxObznyi

Untitled

Jul 18th, 2022
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. n, m = map(int, input().split())
  2. a = []
  3. for i in range(n):
  4. s = input()
  5. a.append(s)
  6.  
  7. di = [-1, 1, 0, 0]
  8. dj = [0, 0, 1, -1]
  9.  
  10. for i in range(n):
  11.  
  12. for j in range(m):
  13. if a[i][j] == '#':
  14. print(a[i][j], end='')
  15. continue #go to the next j
  16.  
  17. hasHashtagNeighbor = False
  18. for d in range(4):
  19. ni = i + di[d]
  20. nj = j + dj[d]
  21. if ni >= 0 and nj >= 0 and ni < n and nj < m and a[ni][nj] == '#':
  22. hasHashtagNeighbor = True
  23. if hasHashtagNeighbor == True:
  24. print('X', end='')
  25. else:
  26. print('.', end='')
  27. print()
  28.  
  29.  
  30.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement