还是我写的nb
def s():
n= int(input())
coins = [i for i in range(1,n+1)]
dp = [0]*(n+1)
dp[0] = 1
mod = 10**9+7
for coin in coins:
for i in range(coin,n+1):
dp[i]+=dp[i-coin]
if dp[i]>mod:
dp[i]%=mod
print(dp[n])
s()