Fibonacci

Medium Recursion

Solve in Playground →

Problem Statement

Write a C++ recursive function that returns the N-th Fibonacci number.

Input Format

A single non-negative integer N.

Output Format

Print the N-th Fibonacci number.

Constraints

0 <= N <= 25

Sample Input

Sample Output

Explanation

Computes Fibonacci using recursive calls: `fib(n) = fib(n-1) + fib(n-2)`.

Starter Code

#include <iostream>

long long recursiveFib(int n) {
    // Write your code here
}

int main() {
    int n;
    if (std::cin >> n) {
        std::cout << recursiveFib(n) << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →