package Code01;
import java.util.Scanner;
public class factorial {
// 阶乘时间算法复杂度
public static void fac_one(int m){
int rec = 1;
int sum = 0;
for(int j=1;j<=m;j++){
rec = rec*j;
sum += rec;
}
System.out.print(sum);
}
public static void main(String[] args){
Scanner s = new Scanner(System.in);
int num = s.nextInt();
fac_one(num);
}
}
输出结果
5
15310
4037913