





"""simple docstring"""






def     __A      (			a_						:list[int]   ,       a_						:list[int])		->		None:
				__a :						Dict			       =  len(a_)
				print('''The following activities are selected:''')

				# The first activity is always selected
				__a :						Optional[int]			       =  0
				print(a_   ,       end=''',''')

				# Consider rest of the activities
				for j in range(a_):
								# If this activity has start time greater than
								# or equal to the finish time of previously
								# selected activity, then select it
								if start[j] >= finish[i]:
												print(a_   ,       end=''',''')
												__a :						Optional[Any]			       =  j


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		A 			=  [1, 3, 0, 5, 8, 5]
		A 			=  [2, 4, 6, 7, 9, 9]
		print_max_activities(start, finish)






"""simple docstring"""






def     __A      (			a_						:int = 2_00)		->		int:
				__a :						int			       =  [1, 2, 5, 10, 20, 50, 1_00, 2_00]
				__a :						List[Any]			       =  [0] * (pence + 1)
				__a :						Tuple			       =  1  # base case: 1 way to make 0 pence

				for coin in coins:
								for i in range(a_   ,       pence + 1   ,       1):
												number_of_ways[i] += number_of_ways[i - coin]
				return number_of_ways[pence]


if __name__ == "__main__":
		assert solution(200) == 73_682