challenge

[Gilles]

RPL but not one-liner. Recursive approch.

Code:


DIR
 J20   { "one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen", "nineteen"}
 J100  { "twenty","thirty","forty","fifty","sixty","seventy","eighty","ninety"}
 Tête  « →STR HEAD STR→ »
 Queue « →STR TAIL STR→ »

 →TXT
  « → n
   « 
    CASE
     'n==0'             THEN "" END
     'n<20'             THEN 'J20' n GET END
     'n≥20 AND n<100'   THEN 'J100'  n Tête 1 - GET n Queue →TXT END
     'n≥100 AND n≤999'  THEN n Tête →TXT "hundred"  n Queue →TXT END
     'n≥1000'           THEN n Tête →TXT "thousand" n Queue →TXT END
    END
   »
   +
  »
  
 Count
  « 
   0
   1 9999 FOR n n 1. DISP
    IF n "" n →TXT SIZE MOD NOT THEN 1 + DUP 2. DISP END
   NEXT
  »
END

Count returns 359 (without AND)

By the way, my english is bad but 9999 should it not be writen as : n-i-n-e-t-h-o-u-s-a-n-d-n-i-n-e-h-u-n-d-r-e-d-A-N-D-n-i-n-e-t-y-n-i-n-e
? (36 letters with an AND inside)