int kaijo(int n) { if(n == 0) return 1; else return (n * kaijo(n-1)); }
int kaijo(int n){ if(n==0) return 1; return n*kaijo(n-1); }
long kaijo(int n){ if(n == 0) return 1L; else return n * kaijo(n - 1); }
void factorial_recursive(){ int n; for(n = 0; n < 13; n++){ printf("%2d!= %10ld\n", n, kaijo(n)); } }
main() { printf("%d! = %d\n", 5, kaijo(5)); }