[C++] HackerRank Day9 Solution

/*
https://www.hackerrank.com/challenges/30-recursion/problem

*/




#include <bits/stdc++.h>

using namespace std;

int factorial(int n) {
    if (n==1) {
        return 1;    //finish recursion at this point
    } else {
        return n * factorial(n-1);  // call this function again (Recursion)
    }
 
}

int main() {
    int n;
    cin >> n;
    int result = factorial(n);
    cout << result << endl;
    return 0;
}