Number letter counts

AUTHOR

Jonathan Scott Duff

https://projecteuler.net/problem=17

If the numbers 1 to 5 are written out in words: one, two, three, four, five, then 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. The use of "and" when writing out numbers is in compliance with British usage.

use v6;



# playing with multiple dispatch

multi sub num-to-word(0) { 'zero' }
multi sub num-to-word(1) { 'one' }
multi sub num-to-word(2) { 'two' }
multi sub num-to-word(3) { 'three' }
multi sub num-to-word(4) { 'four' }
multi sub num-to-word(5) { 'five' }
multi sub num-to-word(6) { 'six' }
multi sub num-to-word(7) { 'seven' }
multi sub num-to-word(8) { 'eight' }
multi sub num-to-word(9) { 'nine' }
multi sub num-to-word(10) { 'ten' }
multi sub num-to-word(11) { 'eleven' }
multi sub num-to-word(12) { 'twelve' }
multi sub num-to-word(13) { 'thirteen' }
multi sub num-to-word(14) { 'fourteen' }
multi sub num-to-word(15) { 'fifteen' }
multi sub num-to-word(16) { 'sixteen' }
multi sub num-to-word(17) { 'seventeen' }
multi sub num-to-word(18) { 'eighteen' }
multi sub num-to-word(19) { 'nineteen' }
multi sub num-to-word(20) { 'twenty' }
multi sub num-to-word(30) { 'thirty' }
multi sub num-to-word(40) { 'forty' }
multi sub num-to-word(50) { 'fifty' }
multi sub num-to-word(60) { 'sixty' }
multi sub num-to-word(70) { 'seventy' }
multi sub num-to-word(80) { 'eighty' }
multi sub num-to-word(90) { 'ninety' }

multi sub num-to-word($n is copy) {
    my (@words,$m);

    # The next three lines should be in a loop, but it's not really
    # worth it for just hundreds and thousands
    $m = truncate($n / 1000);
    @words.push: num-to-word($m), 'thousand' unless $m == 0;
    $n = $n % 1000;

    $m = truncate($n / 100);
    @words.push: num-to-word($m), 'hundred' unless $m == 0;
    $n = $n % 100;
    @words.push: 'and' if $m > 0 and $n > 0;

    if 0 < $n < 20 {
        @words.push: num-to-word($n);
    }
    else {
        my $r = $n % 10;
        $n = truncate($n / 10) * 10;
        @words.push: num-to-word($n) if $n > 0;
        @words.push: num-to-word($r) if $r > 0;
    }
    return @words.join;
}

my $max = @*ARGS[0] // 1000;
my $count = 0;
$count += num-to-word($_).chars for 1..$max;
say $count;

# vim: expandtab shiftwidth=4 ft=perl6

See Also

prob001-cspencer.pl

Multiples of 3 and 5

prob001-eric256.pl

Multiples of 3 and 5

prob001-grondilu.pl

Multiples of 3 and 5

prob001-hexmode.pl

Multiples of 3 and 5

prob001-unobe.pl

Multiples of 3 and 5

prob002-eric256.pl

Even Fibonacci numbers

prob002-gerdr.pl

Even Fibonacci numbers

prob002-hexmode.pl

Even Fibonacci numbers

prob003-eric256.pl

Largest prime factor

prob003-gerdr.pl

Largest prime factor

prob003-hexmode.pl

Largest prime factor

prob003-lanny.pl

Largest prime factor

prob004-unobe.pl

Largest palindrome product

prob004-xfix.pl

Largest palindrome product

prob005-unobe.pl

Smallest multiple

prob005-xfix.pl

Smallest multiple

prob006-polettix.pl

Sum square difference

prob007-polettix.pl

10001st prime

prob008-duff.pl

Largest product in a series

prob008-duff2.pl

Largest product in a series

prob009-gerdr-feeds.raku

Special Pythagorean triplet

prob009-gerdr.raku

Special Pythagorean triplet

prob009-polettix.pl

Special Pythagorean triplet

prob010-polettix.pl

Summation of primes

prob011-moritz.pl

Largest product in a grid

prob012-polettix.pl

Highly divisible triangular number

prob013-grondilu.pl

Large sum

prob014-felher.pl

Longest Collatz sequence

prob015-felher.pl

Lattice paths

prob016-grondilu.pl

Power digit sum

prob018-felher.pl

Maximum path sum I

prob019-grondilu.pl

Counting Sundays

prob020-grondilu.pl

Factorial digit sum

prob021-gerdr.pl

Amicable numbers

prob022-grondilu.pl

Names scores

prob023-shlomif.pl

Non-abundant sums

prob024-moritz.pl

Lexicographic permutations

prob025-polettix.pl

1000-digit Fibonacci number

prob026-shlomif.pl

Reciprocal cycles

prob027-shlomif.pl

Quadratic primes

prob028-shlomif.pl

Number spiral diagonals

prob029-gerdr.pl

Distinct powers

prob029-polettix.pl

Distinct powers

prob031-shlomif.pl

Coin sums

prob033-andreoss.pl

Digit cancelling fractions

prob034-quinny.pl

Digit factorials

prob036-xenu.pl

Double-base palindromes

prob038-andreoss.pl

Pandigital multiples

prob039-quinny.pl

Integer right triangles

prob041-heyajulia-alternative.raku

Pandigital Prime

prob041-heyajulia.raku

Pandigital Prime

prob042-shlomif.p6

Coded triangle numbers

prob047-gerdr.pl

Distinct primes factors

prob052-duff.pl

Permuted multiples

prob053-duff.pl

Combinatoric selections

prob053-gerdr.pl

Combinatoric selections

prob054-andreoss.pl

Poker hands

prob055-shlomif.p6

Lychrel numbers

prob056-shlomif.p6

prob059-andreoss.pl

XOR decryption

prob063-moritz.pl

Powerful digit counts

prob063-polettix.pl

Powerful digit counts

prob065-andreoss.pl

Convergents of e

prob065-grondilu.pl

prob066-andreoss.pl

Diophantine equation

prob067-felher.pl

Maximum path sum II

prob080-andreoss.pl

Square root digital expansion

prob081-moritz.pl

Path sum: two ways

prob089-andreoss.pl

Roman numerals

prob092-moritz.pl

Square digit chains

prob097-andreoss.pl

Large non-Mersenne prime

prob098-andreoss.pl

Anagramic squares

prob099-andreoss.pl

Largest exponential

README.md

The Camelia image is copyright 2009 by Larry Wall. "Raku" is trademark of the Yet Another Society. All rights reserved.