recursive factorial P12509


Statement
 

pdf   zip   main.cc   main.c   main.java   main.py

Write a function that returns @n@!!.

Solve this problem recursively.

Interface

C++ 
int factorial(int n);
C 
int factorial(int n);
Java 
public static int factorial(int n);
Python 
factorial(n)  # returns int
 
factorial(n: int) -> int

Precondition

Assume 0≤0\le @n@ ≤12\le 12.

Observation

You only need to submit the required procedure; your main program will be ignored.

Public test cases

  • Input/Output

    factorial(0) → 1
    factorial(1) → 1
    factorial(2) → 2
    factorial(3) → 6
    factorial(4) → 24
    • Information
    Author
    Jordi Petit
    Language
    English
    Translator
    Carlos Molina
    Original language
    Catalan
    Other languages
    Catalan
    Official solutions
    C C++ Java Python
    User solutions
    C C++ Java Python Rust