


from __future__ import annotations






def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		list[int]       ,  SCREAMING_SNAKE_CASE_   :		int	):





   """simple docstring"""




   if len(SCREAMING_SNAKE_CASE_	) < k or k < 0:
      raise ValueError("""Invalid Input"""	)
   UpperCamelCase         =					UpperCamelCase         =					sum(array[:k]	)
   for i in range(len(SCREAMING_SNAKE_CASE_	) - k	):
      UpperCamelCase         =					current_sum - array[i] + array[i + k]
      UpperCamelCase         =					max(SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_	)
   return max_sum


if __name__ == "__main__":
   from doctest import testmod
   from random import randint

   testmod()
   __snake_case            =   [randint(-1_000, 1_000) for i in range(100)]
   __snake_case            =   randint(0, 110)
   print(F'''The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}''')








def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		int	):





			"""simple docstring"""




			UpperCamelCase         =					int(SCREAMING_SNAKE_CASE_	)
			if decimal in (0, 1):  # Exit cases for the recursion
						return str(SCREAMING_SNAKE_CASE_	)
			UpperCamelCase  ,  UpperCamelCase         =					divmod(SCREAMING_SNAKE_CASE_       ,  2	)
			return binary_recursive(SCREAMING_SNAKE_CASE_	) + str(SCREAMING_SNAKE_CASE_	)






def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		str	):





			"""simple docstring"""




			UpperCamelCase         =					str(SCREAMING_SNAKE_CASE_	).strip()
			if not number:
						raise ValueError("""No input value was provided"""	)
			UpperCamelCase         =					"""-""" if number.startswith("""-"""	) else """"""
			UpperCamelCase         =					number.lstrip("""-"""	)
			if not number.isnumeric():
						raise ValueError("""Input value is not an integer"""	)
			return f'{negative}0b{binary_recursive(int(SCREAMING_SNAKE_CASE_	)	)}'


if __name__ == "__main__":
			from doctest import testmod

			testmod()




