// archives

Dynamic Programming (DP)

This tag is associated with 9 posts

Project Euler 114 Solution

By ⋅ July 28, 2014 ⋅ One comment

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

By ⋅ August 1, 2014 ⋅ Post a comment

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

By ⋅ August 5, 2014 ⋅ Post a comment

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

By ⋅ July 26, 2014 ⋅ Post a comment

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

By ⋅ December 19, 2012 ⋅ Post a comment

Prime Subset Sums

Project Euler 250 Solution

By ⋅ December 18, 2012 ⋅ Post a comment

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

By ⋅ April 1, 2009 ⋅ 15 comments

Maximum sum from top to bottom of triangular array.

Project Euler 81 Solution

By ⋅ April 16, 2009 ⋅ 2 comments

Find the minimal path sum from the top left to the bottom right by moving right and down.

Project Euler 82 Solution

By ⋅ May 5, 2009 ⋅ One comment

Find the minimal path sum from the left column to the right column.

—

Project Euler Level 24