def recursion(n):
if n<2:
return 1
return n*recursion(n-1)
l_sum=0
for i in range(1,11):
l_sum+=recursion(i)
print(l_sum)
递归求乘阶和
最新推荐文章于 2024-05-19 14:20:28 发布
def recursion(n):
if n<2:
return 1
return n*recursion(n-1)
l_sum=0
for i in range(1,11):
l_sum+=recursion(i)
print(l_sum)