编写一函数cusum()求1+2+3+……+n,再编写主函数求1+(1+2)+(1+2+3)+(1+2+3+4)+……+(1+2+3+4+5+……+19+20)的和
时间: 2024-01-14 15:03:20 浏览: 169
可以使用循环来实现求1+2+3+……+n的和,代码如下:
```java
public class Main {
public static int cusum(int n) {
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += i;
}
return sum;
}
public static void main(String[] args) {
int totalSum = 0;
for (int i = 1; i <= 20; i++) {
totalSum += cusum(i);
}
System.out.println("结果是:" + totalSum);
}
}
```
在上面的代码中,`cusum()`函数用于求1+2+3+……+n的和,使用循环从1到n累加每个数字。主函数中使用循环从1到20,每次调用`cusum()`函数求1+2+3+……+i的和,并将结果累加到`totalSum`变量中。最后输出`totalSum`的值。
相关问题
Java实现编写一函数cusum()求1+2+3+……+n,再编写主函数求1+(1+2)+(1+2+3)+(1+2+3+4)+……+(1+2+3+4+5+……+19+20)的和。 2
在Java中,你可以创建两个函数,一个是`cusum`函数用于计算从1到n的等差数列和,另一个是`nestedSum`函数用于递归地应用`cusum`函数来计算给定序列的和。以下是一个示例实现:
```java
public class SumCalculator {
// cusum 函数计算从1到n的和
public static int cusum(int n) {
return (n * (n + 1)) / 2; // 等差数列求和公式:n*(n+1)/2
}
// nestedSum 函数递归求解嵌套的等差数列和
public static int nestedSum(int maxNum) {
int sum = 0;
for (int i = 1; i <= maxNum; ++i) {
sum += cusum(i); // 将当前i范围内的和加到总和上
}
return sum;
}
public static void main(String[] args) {
int n = 20; // 上述题目中需要计算到1到20
int result = nestedSum(n);
System.out.println("从1到" + n + "以及其嵌套序列的和为:" + result);
}
}
10. JavaScript编写一函数cusum()求1+2+3+……+n,再编写主函数求1+(1+2)+(1+2+3)+(1+2+3+4)+……+(1+2+3+4+5+……+19+20)的和。
以下是JavaScript编写的求和函数cusum()和主函数的代码:
```javascript
// 求1+2+3+...+n的和
function cusum(n) {
let sum = 0;
for (let i = 1; i <= n; i++) {
sum += i;
}
return sum;
}
// 求1+(1+2)+(1+2+3)+...+(1+2+3+4+5+...+19+20)的和
function main() {
let sum = 0;
for (let i = 1; i <= 20; i++) {
sum += cusum(i);
}
return sum;
}
console.log(main()); // 输出:2870
```
阅读全文
相关推荐











