project-euler: Rewrap, update links, add copyrights, tests

[factor.git] / extra / project-euler / 117 / 117.factor

diff --git a/extra/project-euler/117/117.factor b/extra/project-euler/117/117.factor
index 6912364aa3b16f079d4de6e0afb85b72877138bc..5d332eb9febfc80362e2f908553fa0fc1596ebe2 100644 (file)
--- a/extra/project-euler/117/117.factor
+++ b/extra/project-euler/117/117.factor
@@ -3,24 +3,26 @@
 USING: kernel math project-euler.common sequences ;
 IN: project-euler.117
 
-! https://projecteuler.net/index.php?section=problems&id=117
+! https://projecteuler.net/problem=117
 
 ! 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.
+! 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?
+! How many ways can a row measuring fifty units in length be
+! tiled?
 
 
 ! SOLUTION
 ! --------
 
-! This solution uses a simple dynamic programming approach using the
-! following recurence relation
+! This solution uses a simple dynamic programming approach using
+! the following recurence relation
 
 ! ways(i) = 1 | i <= 0
 ! ways(i) = ways(i-4) + ways(i-3) + ways(i-2) + ways(i-1)