

def 				UpperCAmelCase_   (						_A = 2_00				):





     '''simple docstring'''




     SCREAMING_SNAKE_CASE__    =    [1, 2, 5, 10, 20, 50, 1_00, 2_00]
     SCREAMING_SNAKE_CASE__    =    [0] * (pence + 1)
     SCREAMING_SNAKE_CASE__    =    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) == 73682









'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      int						)	->	bool:
				_a								= n ** (1 / 3)
				return (val * val * val) == n


if __name__ == "__main__":
					print(perfect_cube(27))
					print(perfect_cube(4))
