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

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

diff --git a/extra/project-euler/017/017.factor b/extra/project-euler/017/017.factor
index 5e153df32ce9ef82e757b8dad74c9a85a78685ff..20cac742aa7c482545f6f48adea1ae5fee93fa79 100644 (file)
--- a/extra/project-euler/017/017.factor
+++ b/extra/project-euler/017/017.factor
@@ -4,27 +4,29 @@ USING: ascii kernel ranges math.text.english sequences
 project-euler.common ;
 IN: project-euler.017
 
-! https://projecteuler.net/index.php?section=problems&id=17
+! https://projecteuler.net/problem=17
 
 ! DESCRIPTION
 ! -----------
 
-! If the numbers 1 to 5 are written out in words: one, two, three, four, five;
-! there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
+! If the numbers 1 to 5 are written out in words: one, two,
+! three, four, five; there are 3 + 3 + 5 + 4 + 4 = 19 letters
+! used in total.
 
-! If all the numbers from 1 to 1000 (one thousand) inclusive were written out
-! in words, how many letters would be used?
+! If all the numbers from 1 to 1000 (one thousand) inclusive
+! were written out in words, how many letters would be used?
 
-! NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and
-! forty-two) contains 23 letters and 115 (one hundred and fifteen) contains
-! 20 letters.
+! NOTE: Do not count spaces or hyphens. For example, 342 (three
+! hundred and forty-two) contains 23 letters and 115 (one
+! hundred and fifteen) contains 20 letters.
 
 
 ! SOLUTION
 ! --------
 
 : euler017 ( -- answer )
-    1000 [1..b] SBUF" " clone [ number>text append! ] reduce [ Letter? ] count ;
+    1000 [1..b] SBUF" " clone [ number>text append! ] reduce
+    [ Letter? ] count ;
 
 ! [ euler017 ] 100 ave-time
 ! 15 ms ave run time - 1.71 SD (100 trials)