UVa - Tag
2013
-
▸
UVa 11259 - Coin Changing Again
UVa 11259 - Coin Changing Again. Uses top-down dynamic programming with state encoding to find all possible ways to make change with limited coin counts. Includes solution with memoization.
-
▸
Number of ways to change making (Dynamic Programming)
A variant of the change making problem that counts the number of distinct ways to make change for a given amount using dynamic programming with coin denominations.
-
▸
Sponsor UVa Online Judge
A sponsorship campaign for UVa Online Judge, one of the oldest and most popular programming problem archives. Includes an embedded Indiegogo widget for donations.