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