coin change problem dynamic programming python

''' We have input values of N and an array Coins  
that holds all of the coins. We use data type  
of because long we want to be able to test  
large values 
without integer overflow'''
  
def getNumberOfWays(N, Coins): 
  
    # Create the ways array to 1 plus the amount 
    # to stop overflow 
    ways = [0] * (N + 1); 
  
    # Set the first way to 1 because its 0 and 
    # there is 1 way to make 0 with 0 coins 
    ways[0] = 1; 
  
    # Go through all of the coins 
    for i in range(len(Coins)): 
  
        # Make a comparison to each index value 
        # of ways with the coin value. 
        for j in range(len(ways)): 
            if (Coins[i] <= j): 
  
                # Update the ways array 
                ways[j] += ways[(int)(j - Coins[i])]; 
  
    # return the value at the Nth position 
    # of the ways array. 
    return ways[N]; 
  
def printArray(coins): 
    for i in coins: 
        print(i); 
  
if __name__ == '__main__': 
    Coins = [1, 5, 10]; 
  
    print("The Coins Array:"); 
    printArray(Coins); 
  
    print("Solution:",end=""); 
    print(getNumberOfWays(12, Coins)); 
  
# This code is contributed by 29AjayKumar