题解 | #牛牛的西格玛#
牛牛的西格玛
https://www.nowcoder.com/practice/c6b750ee8853484f8dbf14b9531b501f
#include <stdio.h>
//递归
long long ADD_(int n)
{
return n>0?(n+ADD_(n-1)):n;
}
int main()
{
int n=0;
scanf("%d",&n);
printf("%lld",ADD_(n));
return 0;
}
