Factorial

Easy Recursion

Solve in Playground →

Problem Statement

Write a C++ recursive function that calculates the factorial of a non-negative integer N.

Input Format

A single non-negative integer N.

Output Format

Print the factorial value.

Constraints

0 <= N <= 20

Sample Input

Sample Output

Explanation

Calculates factorial recursively using base case `0! = 1` and `n! = n * (n-1)!`.

Starter Code

#include <iostream>

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

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

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →