
from __future__ import annotations




def 	A_ (							snake_case							:   list[list[int]] )      ->    bool:



      '''simple docstring'''

      __UpperCamelCase       =			len(snake_case )
      # We need to create solution object to save path.
      __UpperCamelCase       =			[[0 for _ in range(snake_case )] for _ in range(snake_case )]
      __UpperCamelCase       =			run_maze(snake_case ,      0 ,      0 ,      snake_case )
      if solved:
            print('''\n'''.join(str(snake_case ) for row in solutions ) )
      else:
            print('''No solution exists!''' )
      return solved




def 	A_ (							snake_case							:   list[list[int]] ,      snake_case							:   int ,      snake_case							:   int ,      snake_case							:   list[list[int]] )      ->    bool:



      '''simple docstring'''

      __UpperCamelCase       =			len(snake_case )
      # Final check point.
      if i == j == (size - 1):
            __UpperCamelCase       =			1
            return True

      __UpperCamelCase       =			(not i < 0) and (not j < 0)  # Check lower bounds
      __UpperCamelCase       =			(i < size) and (j < size)  # Check upper bounds

      if lower_flag and upper_flag:
            # check for already visited and block points.
            __UpperCamelCase       =			(not solutions[i][j]) and (not maze[i][j])
            if block_flag:
                  # check visited
                  __UpperCamelCase       =			1

                  # check for directions
                  if (
                      run_maze(snake_case ,      i + 1 ,      snake_case ,      snake_case )
                      or run_maze(snake_case ,      snake_case ,      j + 1 ,      snake_case )
                      or run_maze(snake_case ,      i - 1 ,      snake_case ,      snake_case )
                      or run_maze(snake_case ,      snake_case ,      j - 1 ,      snake_case )
                  ):
                        return True

                  __UpperCamelCase       =			0
                  return False
      return False


if __name__ == "__main__":
    import doctest

    doctest.testmod()






def 	A_ (							snake_case							:   float )      ->    float:



						'''simple docstring'''

						if edge <= 0 or not isinstance(snake_case ,      snake_case ):
												raise ValueError('''Length must be a positive.''' )
						return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)




def 	A_ (							snake_case							:   float )      ->    float:



						'''simple docstring'''

						if edge <= 0 or not isinstance(snake_case ,      snake_case ):
												raise ValueError('''Length must be a positive.''' )
						return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
				import doctest

				doctest.testmod()




