CoinChange.py

# Dynamic Programming Python implementation of Coin
# Change problem
def count(S, m, n):

	table = [0 for k in range(n+1)]

	table[0] = 1

	for i in range(0,m):
		for j in range(S[i],n+1):
			table[j] += table[j-S[i]]

	return table[n]

arr = list(map(int,input().split()))
m = len(arr)
n = 4
x = count(arr, m, n)
print (x)