一、求n! 的乘积
#includestdio.hintfirst(intn ); int main () {int n,answer; printf(pleaseinput.n ); scanf('%d ',n ); if(N1 ) printf(pleaseinputAgian.n ); else{answer=first(n; printf('%d!=%dn ',n,answer; }result 0; (intfirst(intn ); {if(n==1) return 1; else返回n * first (n-1; (二、编程实现12、3、4…hxsdhbn的递归
#includestdio.hintsecond(intn ); int main () {int n,answer; printf(pleaseinput.n ); scanf('%d ',n ); if(N1 ) printf(pleaseinputAgian.n ); else{answer=second(n; printf('%d!=%d ',n,answer; }返回0; }intsecond(intn ) if ) n==1) return 1; 电子邮件地址(n-1; }