Project Euler 117: Count the number of ways a space 50 units long could be filled by tiles, heterogeneously, measuring 2, 3 or 4 units long.
Problem Description
Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways.
How many ways can a row measuring fifty units in length be tiled?
NOTE: This is related to Problem 116.
Analysis
As the simplest solution for the problem set requium, we make a small change to problem 116 by allowing multiple tiles of length 2, 3 and 4 to share the space.
Project Euler 117 Solution
Runs < 0.001 seconds in Python 2.7.Use this link to get the Project Euler 117 Solution Python 2.7 source.
Afterthoughts
- See also, Project Euler 116 Solution:
Project Euler 117 Solution last updated
Discussion
No comments yet.