


"""simple docstring"""





def      _snake_case						(						_snake_case				:			list[int] ,   _snake_case				:			list[int]			):
      lowerCAmelCase					:	Dict       =   len(snake_case__			)
      print('''The following activities are selected:'''			)

      # The first activity is always selected
      lowerCAmelCase					:	Optional[Any]       =   0
      print(snake_case__ ,   end=''','''			)

      # Consider rest of the activities
      for j in range(snake_case__			):
            # If this activity has start time greater than
            # or equal to the finish time of previously
            # selected activity, then select it
            if start[j] >= finish[i]:
                  print(snake_case__ ,   end=''','''			)
                  lowerCAmelCase					:	List[Any]       =   j


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 snake_case__		:     Tuple    				=				[1, 3, 0, 5, 8, 5]
 snake_case__		:     Union[str, Any]    				=				[2, 4, 6, 7, 9, 9]
 print_max_activities(start, finish)






"""simple docstring"""





from __future__ import annotations

from PIL import Image

# Define glider example
snake_case__		:     int    				=				[
    [0, 1, 0, 0, 0, 0, 0, 0],
    [0, 0, 1, 0, 0, 0, 0, 0],
    [1, 1, 1, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
]

# Define blinker example
snake_case__		:     Any    				=				[[0, 1, 0], [0, 1, 0], [0, 1, 0]]


def      _snake_case						(						_snake_case				:			list[list[int]]			):
      lowerCAmelCase					:	Union[str, Any]       =   []
      for i in range(len(_snake_case			)			):
            lowerCAmelCase					:	Any       =   []
            for j in range(len(cells[i]			)			):
                  # Get the number of live neighbours
                  lowerCAmelCase					:	Optional[int]       =   0
                  if i > 0 and j > 0:
                        neighbour_count += cells[i - 1][j - 1]
                  if i > 0:
                        neighbour_count += cells[i - 1][j]
                  if i > 0 and j < len(cells[i]			) - 1:
                        neighbour_count += cells[i - 1][j + 1]
                  if j > 0:
                        neighbour_count += cells[i][j - 1]
                  if j < len(cells[i]			) - 1:
                        neighbour_count += cells[i][j + 1]
                  if i < len(_snake_case			) - 1 and j > 0:
                        neighbour_count += cells[i + 1][j - 1]
                  if i < len(_snake_case			) - 1:
                        neighbour_count += cells[i + 1][j]
                  if i < len(_snake_case			) - 1 and j < len(cells[i]			) - 1:
                        neighbour_count += cells[i + 1][j + 1]

                  # Rules of the game of life (excerpt from Wikipedia):
                  # 1. Any live cell with two or three live neighbours survives.
                  # 2. Any dead cell with three live neighbours becomes a live cell.
                  # 3. All other live cells die in the next generation.
                  #    Similarly, all other dead cells stay dead.
                  lowerCAmelCase					:	str       =   cells[i][j] == 1
                  if (
                      (alive and 2 <= neighbour_count <= 3)
                      or not alive
                      and neighbour_count == 3
                  ):
                        next_generation_row.append(1			)
                  else:
                        next_generation_row.append(0			)

            next_generation.append(_snake_case			)
      return next_generation


def      _snake_case						(						_snake_case				:			list[list[int]] ,   _snake_case				:			int			):
      lowerCAmelCase					:	int       =   []
      for _ in range(_snake_case			):
            # Create output image
            lowerCAmelCase					:	Union[str, Any]       =   Image.new('''RGB''' ,   (len(cells[0]			), len(_snake_case			))			)
            lowerCAmelCase					:	Union[str, Any]       =   img.load()

            # Save cells to image
            for x in range(len(_snake_case			)			):
                  for y in range(len(cells[0]			)			):
                        lowerCAmelCase					:	Optional[int]       =   255 - cells[y][x] * 255
                        lowerCAmelCase					:	List[Any]       =   (colour, colour, colour)

        # Save image
            images.append(_snake_case			)
            lowerCAmelCase					:	Union[str, Any]       =   new_generation(_snake_case			)
      return images


if __name__ == "__main__":
 snake_case__		:     Union[str, Any]    				=				generate_images(GLIDER, 16)
 images[0].save('''out.gif''', save_all=True, append_images=images[1:])


