C++ 计算阶乘：高效算法实现

#include using namespace std;

int factorial(int n) { if(n == 0 || n == 1) { return 1; } else { return n * factorial(n-1); } }

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