CS/Algorithm & Data Structure
[BOJ][C++] 백준 10872 팩토리얼
Yeji Heo
2022. 11. 22. 09:09
방법 1. 재귀
#include <iostream>
using namespace std;
int factorial(int n) {
if (n == 1 || n==0) {
return 1;
}
else {
return n * factorial(n - 1);
}
}
int main()
{
int N;
cin >> N;
cout<<factorial(N);
}
방법 2. 반복문
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int result=1;
for (int i = N; i > 0; i--) {
result *= i;
}
cout << result;
}