2007-12-24 04:36:40 -05:00
|
|
|
! Copyright (c) 2007 Samuel Tardieu, Aaron Schaefer.
|
2007-12-21 11:43:26 -05:00
|
|
|
! See http://factorcode.org/license.txt for BSD license.
|
2007-12-24 13:07:46 -05:00
|
|
|
USING: combinators.lib kernel math math.ranges math.text namespaces sequences
|
|
|
|
strings ;
|
2007-12-21 11:43:26 -05:00
|
|
|
IN: project-euler.017
|
|
|
|
|
|
|
|
! http://projecteuler.net/index.php?section=problems&id=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 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.
|
|
|
|
|
2007-12-24 04:36:40 -05:00
|
|
|
|
2007-12-21 11:43:26 -05:00
|
|
|
! SOLUTION
|
|
|
|
! --------
|
|
|
|
|
|
|
|
<PRIVATE
|
|
|
|
|
|
|
|
: units ( n -- )
|
|
|
|
{
|
|
|
|
"zero" "one" "two" "three" "four" "five" "six" "seven" "eight" "nine"
|
|
|
|
"ten" "eleven" "twelve" "thirteen" "fourteen" "fifteen" "sixteen"
|
|
|
|
"seventeen" "eighteen" "nineteen"
|
|
|
|
} nth % ;
|
|
|
|
|
|
|
|
: tenths ( n -- )
|
|
|
|
{
|
|
|
|
f f "twenty" "thirty" "fourty" "fifty" "sixty" "seventy" "eighty" "ninety"
|
|
|
|
} nth % ;
|
|
|
|
|
|
|
|
DEFER: make-english
|
|
|
|
|
|
|
|
: maybe-add ( n sep -- )
|
2007-12-24 04:36:40 -05:00
|
|
|
over zero? [ 2drop ] [ % make-english ] if ;
|
2007-12-21 11:43:26 -05:00
|
|
|
|
|
|
|
: 0-99 ( n -- )
|
|
|
|
dup 20 < [ units ] [ 10 /mod swap tenths "-" maybe-add ] if ;
|
|
|
|
|
|
|
|
: 0-999 ( n -- )
|
|
|
|
100 /mod swap
|
2007-12-24 04:36:40 -05:00
|
|
|
dup zero? [ drop 0-99 ] [ units " hundred" % " and " maybe-add ] if ;
|
2007-12-21 11:43:26 -05:00
|
|
|
|
|
|
|
: make-english ( n -- )
|
|
|
|
1000 /mod swap
|
2007-12-24 04:36:40 -05:00
|
|
|
dup zero? [ drop 0-999 ] [ 0-999 " thousand" % " and " maybe-add ] if ;
|
2007-12-21 11:43:26 -05:00
|
|
|
|
|
|
|
PRIVATE>
|
|
|
|
|
|
|
|
: >english ( n -- str )
|
|
|
|
[ make-english ] "" make ;
|
|
|
|
|
|
|
|
: euler017 ( -- answer )
|
2007-12-24 04:36:40 -05:00
|
|
|
1000 [1,b] [ >english [ letter? ] subset length ] map sum ;
|
2007-12-21 11:43:26 -05:00
|
|
|
|
|
|
|
! [ euler017 ] 100 ave-time
|
|
|
|
! 9 ms run / 0 ms GC ave time - 100 trials
|
|
|
|
|
2007-12-24 04:36:40 -05:00
|
|
|
|
|
|
|
! ALTERNATE SOLUTIONS
|
|
|
|
! -------------------
|
|
|
|
|
|
|
|
: euler017a ( -- answer )
|
2007-12-24 13:07:46 -05:00
|
|
|
1000 [1,b] SBUF" " clone [ number>text over push-all ] reduce [ Letter? ] count ;
|
2007-12-24 04:36:40 -05:00
|
|
|
|
|
|
|
! [ euler017a ] 100 ave-time
|
|
|
|
! 14 ms run / 1 ms GC ave time - 100 trials
|
|
|
|
|
2007-12-21 11:43:26 -05:00
|
|
|
MAIN: euler017
|