




from collections.abc import Sequence

def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> float:
       return sum(c * (x**i) for i, c in enumerate(_SCREAMING_SNAKE_CASE    )    )

def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> float:
       lowerCamelCase   :      str			 =					0.0
       for coeff in reversed(_SCREAMING_SNAKE_CASE    ):
              lowerCamelCase   :      Tuple			 =					result * x + coeff
       return result


if __name__ == "__main__":
       SCREAMING_SNAKE_CASE__       :      int  =   (0.0, 0.0, 5.0, 9.3, 7.0)
       SCREAMING_SNAKE_CASE__       :      Union[str, Any]  =   10.0
       print(evaluate_poly(poly, x))
       print(horner(poly, x))












from math import sqrt

def      A      (      _SCREAMING_SNAKE_CASE = 100_0000    )	-> int:
       lowerCamelCase   :      int			 =					0
       lowerCamelCase   :      int			 =					0
       lowerCamelCase   :      int

       while num_cuboids <= limit:
              max_cuboid_size += 1
              for sum_shortest_sides in range(2 ,2 * max_cuboid_size + 1    ):
                     if sqrt(sum_shortest_sides**2 + max_cuboid_size**2    ).is_integer():
                            num_cuboids += (
                                min(_SCREAMING_SNAKE_CASE ,sum_shortest_sides // 2    )
                                - max(1 ,sum_shortest_sides - max_cuboid_size    )
                                + 1
                            )

       return max_cuboid_size


if __name__ == "__main__":
       print(f'''{solution() = }''')






