

from __future__ import annotations



def 					lowerCAmelCase__							(	SCREAMING_SNAKE_CASE_:							int	,       SCREAMING_SNAKE_CASE_:							int      )			->      list[str]:




				'''simple docstring'''





				if partitions <= 0:
								raise ValueError("partitions must be a positive number!"      )
				if partitions > number_of_bytes:
								raise ValueError("partitions can not > number_of_bytes!"      )
				A__        =			number_of_bytes // partitions
				A__        =			[]
				for i in range(SCREAMING_SNAKE_CASE_      ):
								A__        =			i * bytes_per_partition + 1
								A__        =			(
								    number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
								)
								allocation_list.append(F'{start_bytes}-{end_bytes}'      )
				return allocation_list


if __name__ == "__main__":
	import doctest

	doctest.testmod()




import math

lowerCAmelCase__	   = 1_0
lowerCAmelCase__	   = 7
lowerCAmelCase__	   = BALLS_PER_COLOUR * NUM_COLOURS



def 					lowerCAmelCase__							(	SCREAMING_SNAKE_CASE_:							int = 2_0      )			->      str:




				'''simple docstring'''





				A__        =			math.comb(SCREAMING_SNAKE_CASE_	,       SCREAMING_SNAKE_CASE_      )
				A__        =			math.comb(NUM_BALLS - BALLS_PER_COLOUR	,       SCREAMING_SNAKE_CASE_      )

				A__        =			NUM_COLOURS * (1 - missing_colour / total)

				return F'{result:.9f}'


if __name__ == "__main__":
	print(solution(2_0))

