✅ 재귀
문제
링크
![](https://media.vlpt.us/images/peanut_/post/c950b1c8-155e-4da4-8b41-53ca46ca0e39/%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202022-04-02%20%E1%84%8B%E1%85%A9%E1%84%8C%E1%85%A5%E1%86%AB%2012.37.07.png)
코드
#include <iostream>
using namespace std;
int factorial(int N)
{
if (N <= 1)
return 1;
else
return N * factorial(N - 1);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
cout << factorial(N);
return 0;
}