简单递归求阶乘

#include<iostream>using namespace std;int factorial(int n){    if(n==0)    return 1;    else return n*factorial(n-1);} int main(){    int x;    while(cin>>x){        cout<<factorial(x)<<endl;    }}