



'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:float   ,				UpperCamelCase__				:float   ,				UpperCamelCase__				:int			)		->						float:
				snake_case__      :   Optional[Any]      =    [1 / first_term]
				snake_case__      :   Optional[int]      =    1 / first_term
				for _ in range(number_of_terms - 1			):
								first_term += common_difference
								arithmetic_progression.append(UpperCamelCase__			)
				snake_case__      :   Any      =    [1 / step for step in arithmetic_progression]
				return sum(UpperCamelCase__			)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(sum_of_harmonic_progression(1 / 2, 2, 2))









'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:int   ,				UpperCamelCase__				:list			)		->						list:
				snake_case__      :   List[str]      =    sorted(UpperCamelCase__   ,				key=lambda UpperCamelCase__			: value[2]   ,				reverse=UpperCamelCase__			)

				# Create a list of size equal to the maximum deadline
				# and initialize it with -1
				snake_case__      :   Any      =    max(UpperCamelCase__   ,				key=lambda UpperCamelCase__			: value[1]			)[1]
				snake_case__      :   str      =    [-1] * max_deadline

				# Finding the maximum profit and the count of jobs
				snake_case__      :   List[str]      =    0
				snake_case__      :   Optional[Any]      =    0
				for job in jobs:
								# Find a free time slot for this job
								# (Note that we start from the last possible slot)
								for i in range(job[1] - 1   ,				-1   ,				-1			):
												if time_slots[i] == -1:
																snake_case__      :   Optional[Any]      =    job[0]
																count += 1
																max_profit += job[2]
																break
				return [count, max_profit]


if __name__ == "__main__":
				import doctest

				doctest.testmod()




