编辑代码

def coin_collect(coins, target):
    n = len(coins)
    dp = [[0] * (target + 1) for _ in range(n + 1)]
    
    # Initialization
    for i in range(n + 1):
        dp[i][0] = 1
    
    # Dynamic Programming
    for i in range(1, n + 1):
        for j in range(1, target + 1):
            dp[i][j] = dp[i-1][j]
            if j >= coins[i-1]:
                dp[i][j] += dp[i-1][j - coins[i-1]]
    
    return dp[n][target]

# Example
coins = [1, 2, 5]
target = 11
result = coin_collect(coins, target)
print("Number of ways to collect coins:", result)