Add solution for UVA problem 147 Dollars
Dynamic Programming

Recurrence :

i : consider the 1st...i-th notes
m : dollars to change
dp[i][m] : the count of composition to change dollars m by 1st...i-th
notes

(1) dp[i][m] = dp[i - 1][m] + dp[i][m - notes[i]], if (m - notes[i]) >= 0
(2) dp[i][m] = dp[i - 1][m], if (m - notes[i]) < 0