题解 | #牛牛的西格玛#
牛牛的西格玛
https://www.nowcoder.com/practice/c6b750ee8853484f8dbf14b9531b501f
#include <stdio.h> int sum(n){ if(n==1) return n; return sum(n-1)+n; } int main() { int n; scanf("%d",&n); int ret=sum(n); printf("%d",ret); return 0; }
牛牛的西格玛
https://www.nowcoder.com/practice/c6b750ee8853484f8dbf14b9531b501f
#include <stdio.h> int sum(n){ if(n==1) return n; return sum(n-1)+n; } int main() { int n; scanf("%d",&n); int ret=sum(n); printf("%d",ret); return 0; }
相关推荐