递归算法；求n的阶层

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        String a=sc.next();
        int b=Integer.parseInt(a);
        System.out.print(factorial(b));
    }
    public static int factorial(int a){
        if(a==1){
            return a;
        }else{
            return factorial(a-1)*a;
        }
    }
}

#include <stdio.h>

long factorial(int a){
    if(a==1){
    return a;
    }
    else{
        return factorial(a-1)*a;
    }
}
int main()
{
    int a;
    scanf("%d",&a);
    printf("%d",factorial(a));
   return 0;
}