编写函数 分别利用递归与嵌套方法，求出1！+2！+3！+4！+5！+6！+7！+8！+9！+10！

递归方法：

def factorial_recursive(n):
    if n == 1:
        return 1
    else:
        return n * factorial_recursive(n-1)
        
for i in range(1, 11):
    print(factorial_recursive(i))

嵌套方法：

def factorial_nested(n):
    result = 1
    for i in range(1, n+1):
        inner_result = 1
        for j in range(1, i+1):
            inner_result *= j
        result *= inner_result
    return result
    
for i in range(1, 11):
    print(factorial_nested(i))