Recursive Power

Compute base to the power exponent with recursion: x⁰ = 1, and xⁿ = (x^(n/2))² for even n or x × (x^((n−1)/2))² for odd n. This uses far fewer multiplications than a simple loop.

Implement recursive_power(base, exponent).

Input

base: The base. exponent: The exponent (zero or positive).

Output

Return base raised to exponent.

Contraintes

-10 ≤ base ≤ 10; 0 ≤ exponent ≤ 18

Exemples

Entrée :
base = 3
exponent = 5

Sortie attendue :
expected = 243

Entrée :
long long base = 3;
long long exponent = 5;

Sortie attendue :
long long expected = 243;

Entrée :
long base = 3;
long exponent = 5;

Sortie attendue :
long expected = 243;

Entrée :
base = 7
exponent = 0

Sortie attendue :
expected = 1

Entrée :
long long base = 7;
long long exponent = 0;

Sortie attendue :
long long expected = 1;

Entrée :
long base = 7;
long exponent = 0;

Sortie attendue :
long expected = 1;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Fordham CS1600 Computer Science I - schedule and labs