





'''simple docstring'''

from __future__ import annotations

from PIL import Image

# Define glider example
a   	=    [
    [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
a   	=    [[0, 1, 0], [0, 1, 0], [0, 1, 0]]

def     __magic_name__							(				__UpperCAmelCase   )    ->       list[list[int]]:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							[]
   for i in range(len(__UpperCAmelCase   )   ):
      __SCREAMING_SNAKE_CASE   				=							[]
      for j in range(len(cells[i]   )   ):
         # Get the number of live neighbours
         __SCREAMING_SNAKE_CASE   				=							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(__UpperCAmelCase   ) - 1 and j > 0:
            neighbour_count += cells[i + 1][j - 1]
         if i < len(__UpperCAmelCase   ) - 1:
            neighbour_count += cells[i + 1][j]
         if i < len(__UpperCAmelCase   ) - 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.
         __SCREAMING_SNAKE_CASE   				=							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(__UpperCAmelCase   )
   return next_generation

def     __magic_name__							(				__UpperCAmelCase				,						__UpperCAmelCase   )    ->       list[Image.Image]:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							[]
   for _ in range(__UpperCAmelCase   ):
      # Create output image
      __SCREAMING_SNAKE_CASE   				=							Image.new("""RGB"""				,						(len(cells[0]   ), len(__UpperCAmelCase   ))   )
      __SCREAMING_SNAKE_CASE   				=							img.load()

      # Save cells to image
      for x in range(len(__UpperCAmelCase   )   ):
         for y in range(len(cells[0]   )   ):
            __SCREAMING_SNAKE_CASE   				=							255 - cells[y][x] * 255
            __SCREAMING_SNAKE_CASE   				=							(colour, colour, colour)

        # Save image
      images.append(__UpperCAmelCase   )
      __SCREAMING_SNAKE_CASE   				=							new_generation(__UpperCAmelCase   )
   return images


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












'''simple docstring'''

def     __magic_name__							(				__UpperCAmelCase				,						__UpperCAmelCase   )    ->       str:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							(boundary[1] - boundary[0]) / steps
   __SCREAMING_SNAKE_CASE   				=							boundary[0]
   __SCREAMING_SNAKE_CASE   				=							boundary[1]
   __SCREAMING_SNAKE_CASE   				=							make_points(__UpperCAmelCase				,						__UpperCAmelCase				,						__UpperCAmelCase   )
   __SCREAMING_SNAKE_CASE   				=							0.0
   y += (h / 2.0) * f(__UpperCAmelCase   )
   for i in x_i:
      # print(i)
      y += h * f(__UpperCAmelCase   )
   y += (h / 2.0) * f(__UpperCAmelCase   )
   return y

def     __magic_name__							(				__UpperCAmelCase				,						__UpperCAmelCase				,						__UpperCAmelCase   )    ->       Optional[Any]:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							a + h
   while x < (b - h):
      yield x
      __SCREAMING_SNAKE_CASE   				=							x + h

def     __magic_name__							(				__UpperCAmelCase   )    ->       int:  # enter your function here

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							(x - 0) * (x - 0)
   return y

def     __magic_name__							(				)    ->       Tuple:

   '''simple docstring'''







   __SCREAMING_SNAKE_CASE   				=							0.0  # Lower bound of integration
   __SCREAMING_SNAKE_CASE   				=							1.0  # Upper bound of integration
   __SCREAMING_SNAKE_CASE   				=							1_0.0  # define number of steps or resolution
   __SCREAMING_SNAKE_CASE   				=							[a, b]  # define boundary of integration
   __SCREAMING_SNAKE_CASE   				=							method_a(__UpperCAmelCase				,						__UpperCAmelCase   )
   print(f"""y = {y}"""   )


if __name__ == "__main__":
    main()





