Problem #31 is one of the many Project Euler problems that can be efficiently solved with Dynamic Programming. The question reads: Project Euler Problem 31: Coin sums In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation: 1p, 2p, 5p, 10p, 20p, 50p, £1 …
Tag Archives: Dynamic Programming
Project Euler Problem #18:
Problem #18 is one of the first problems on Project Euler to prominently feature DP (Dynamic Programming) and the first to explicitly be part of a series of similar problems. The problem reads: Project Euler Problem 18: Maximum path sum I By starting at the top of the triangle below and moving to adjacent numbers …
The Inner Machinations of Walker 