输入1个正整数 n,计算 1+(1+2)+(1+2+3)+ …… +(1+2+3+ …… +n)
时间: 2023-09-29 18:06:58 浏览: 141
要算 1 (1 2) (1 2 3) …… (1 2 3 …… n),可以使用递归的方法。首先,定义一个递归函数sum,它接受一个参数n。如果n等于1,那么返回1;否则,返回sum(n-1)与n的乘积。具体的代码如下:
```
int sum(int n) {
if(n == 1)
return 1;
else
return (sum(n-1) * n);
}
```
你可以将输入的正整数n作为参数传递给这个函数,它将返回计算结果。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [C语言——输入一个整数(n),求1+2+3+……+n的值](https://blog.csdn.net/A12NCH3N/article/details/103981039)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [python编写程序,输入一个整数n,计算1/1-1/2+1/3-1/4+……+1/n的值](https://blog.csdn.net/weixin_36017951/article/details/116180358)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]