package com;
public class SumOfFactoria {
//球你N!的和
public static long f1(int N) {
long sum = 0;
for (int i = 1; i <= N; i++) {
sum += factorial(i);
}
return sum;
}
//这个是先求N的阶乘
public static long factorial(int N) {
long ans = 1;
for (int i = 1; i <= N; i++) {
ans *= i;
}
return ans;
}
//整和到一起
public static long f2(int N) {
int ans = 1;
int sum = 0;
for (int i = 1; i <= N; i++) {
ans *= i;
sum += ans;
}
return sum;
}
public static void main(String[] args) {
int N = 1;
System.out.println(f1(2));
System.out.println(f2(2));
}
}
求1到n的阶乘之和
最新推荐文章于 2024-06-17 13:56:54 发布