



from __future__ import annotations


def A    (							__UpperCamelCase			,						__UpperCamelCase       )    ->   list[str]:
			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(__UpperCamelCase       ):
						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()








def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return x if y == 0 else greatest_common_divisor(a__     ,    x % y			)

def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return (x * y) // greatest_common_divisor(a__     ,    a__			)

def 			lowerCAmelCase__					(     a__:						int = 2_0			)    ->						int:


							'''simple docstring'''





							_UpperCAmelCase											=     1
							for i in range(1     ,    n + 1			):
														_UpperCAmelCase											=     lcm(a__     ,    a__			)
							return g


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