// archives

Dynamic Programming (DP)

This tag is associated with 13 posts

Project Euler 114 Solution

Count the ways a row measuring fifty units in length could be filled with blocks three units long. The blocks must be separated by at least one empty space.

Project Euler 115 Solution

Fill an empty row with blocks, a minimum length of 50 units, until the size of the row exceeds 1,000,000 units. The blocks must be separated by at least one empty space.

Project Euler 116 Solution

Count the number of ways a space 50 units long could be filled by tiles, homogeneously, measuring 2, 3 or 4 units long.

Project Euler 117 Solution

Count the number of ways a space 50 units long could be filled by tiles, heterogeneously, measuring 2, 3 or 4 units long.

Project Euler 249 Solution

Prime Subset Sums

Project Euler 250 Solution

Find the number of non-empty subsets of {11, 22, 33,…, 250250250250}, the sum of whose elements is divisible by 250.

Project Euler 18 Solution

Maximum sum from top to bottom of triangular array.

Project Euler 31 Solution

Investigating combinations of English currency denominations.

Project Euler 67 Solution

Find the maximum total from top to bottom in a large triangle of numbers using an efficient algorithm.

Project Euler 76 Solution

How many different ways can one hundred be written as a sum of at least two positive integers?