HDOJ-ACM1017(JAVA)

import java.math.BigInteger;import java.util.Scanner;public class Main {    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);                while (sc.hasNextInt()) {            int n = sc.nextInt();            if (n < 0) break;  // 如果题目有结束条件            System.out.println(factorial(n));        }                sc.close();    }        // 计算阶乘函数，返回字符串    public static BigInteger factorial(int n) {        BigInteger res = BigInteger.ONE;        for (int i = 2; i <= n; i++) {            res = res.multiply(BigInteger.valueOf(i));        }        return res;    }}php623 Bytes© 菜鸟-创作你的创作

import java.math.BigInteger;import java.util.Scanner;public class Main {    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        while (sc.hasNextInt()) {            int n = sc.nextInt();            if (n < 0) break;  // 如果题目要求停止输入的条件            System.out.println(factorial(n));        }        sc.close();    }    // 计算阶乘    public static BigInteger factorial(int n) {        BigInteger result = BigInteger.ONE;        for (int i = 2; i <= n; i++) {            result = result.multiply(BigInteger.valueOf(i));        }        return result;    }}php609 Bytes© 菜鸟-创作你的创作

5100php6 Bytes© 菜鸟-创作你的创作

12036288001php13 Bytes© 菜鸟-创作你的创作