package Recursive;
import java.math.BigInteger;
import java.util.Scanner;
public class Exercise18_01 {
public static void main(String[] args) {
System.out.print("Enter a nonnegative integer: ");
int n = new Scanner(System.in).nextInt();
System.out.println(n + "! is " + factorial(n));
}
/** 返回阶乘 */
public static BigInteger factorial(int n) {
if (n == 0 || n == 1)
return BigInteger.ONE;
else
return BigInteger.valueOf(n).multiply(factorial(n - 1));
}
}