



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()





"""simple docstring"""






from __future__ import annotations


def      UpperCAmelCase__			(							lowerCAmelCase__	:dict   ,						lowerCAmelCase__	:str						)					->       set[str]:
      '''simple docstring'''


      lowercase				,				lowercase								=      set(lowerCAmelCase__						), [start]

      while stack:
            lowercase								=      stack.pop()
            explored.add(lowerCAmelCase__						)
            # Differences from BFS:
            # 1) pop last element instead of first one
            # 2) add adjacent elements to stack without exploring them
            for adj in reversed(graph[v]						):
                  if adj not in explored:
                        stack.append(lowerCAmelCase__						)
      return explored


__lowerCAmelCase       :			str   	={
    """A""": ["""B""", """C""", """D"""],
    """B""": ["""A""", """D""", """E"""],
    """C""": ["""A""", """F"""],
    """D""": ["""B""", """D"""],
    """E""": ["""B""", """F"""],
    """F""": ["""C""", """E""", """G"""],
    """G""": ["""F"""],
}

if __name__ == "__main__":
       import doctest

       doctest.testmod()
       print(depth_first_search(G, """A"""))



