


def 							__lowercase     (				__lowerCAmelCase							:       int      ,					__lowerCAmelCase							:       int     ):
							if b == 0:
														return 1
							if (b % 2) == 0:
														return actual_power(__lowerCAmelCase      ,					int(b / 2     )     ) * actual_power(__lowerCAmelCase      ,					int(b / 2     )     )
							else:
														return a * actual_power(__lowerCAmelCase      ,					int(b / 2     )     ) * actual_power(__lowerCAmelCase      ,					int(b / 2     )     )






def 							__lowercase     (				__lowerCAmelCase							:       int      ,					__lowerCAmelCase							:       int     ):
							if b < 0:
														return 1 / actual_power(__lowerCAmelCase      ,					__lowerCAmelCase     )
							return actual_power(__lowerCAmelCase      ,					__lowerCAmelCase     )


if __name__ == "__main__":
						print(power(-2, -3))








def 							__lowercase     (				__lowerCAmelCase							:       int = 2_0_0     ):
							a__    =  [1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
							a__    =  [0] * (pence + 1)
							a__    =  1  # base case: 1 way to make 0 pence

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


if __name__ == "__main__":
						assert solution(2_00) == 7_36_82




