Power

Medium Recursion

Solve in Playground →

Problem Statement

Write a C++ recursive function that computes base^exponent.

Input Format

Base (int) and exponent (int).

Output Format

Print base raised to exponent.

Constraints

1 <= base <= 20, 0 <= exp <= 12

Sample Input

2 5

Sample Output

Explanation

Calculates power recursively: `power(b, e) = b * power(b, e-1)`.

Starter Code

#include <iostream>

long long recursivePower(int base, int exp) {
    // Write your code here
}

int main() {
    int base, exp;
    if (std::cin >> base >> exp) {
        std::cout << recursivePower(base, exp) << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →