Roman numerals

AUTHOR

Andrei Osipov

https://projecteuler.net/problem=89

For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is always a "best" way of writing a particular number.

For example, it would appear that there are at least six ways of writing the number sixteen:

IIIIIIIIIIIIIIII

VIIIIIIIIIII

VVIIIIII

XIIIIII

VVVI

XVI

However, according to the rules only XIIIIII and XVI are valid, and the last example is considered to be the most efficient, as it uses the least number of numerals.

The 11K text file roman.txt contains one thousand numbers written in valid, but not necessarily minimal, Roman numerals; see About... Roman Numerals for the definitive rules for this problem.

Find the number of characters saved by writing each of these in their minimal form.

Note: You can assume that all the Roman numerals in the file contain no more than four consecutive identical units.

use v6;



use experimental :cached;

multi roman-to-int() { 0 }
multi roman-to-int(Str $r where $r.chars > 1 ) {
    roman-to-int(| $r.comb)
}

multi roman-to-int('I', 'X', |a) { 9   + roman-to-int |a }
multi roman-to-int('I', 'V', |a) { 4   + roman-to-int |a }
multi roman-to-int('I',      |a) { 1   + roman-to-int |a }

multi roman-to-int('X', 'L', |a) { 40  + roman-to-int |a }
multi roman-to-int('X', 'C', |a) { 90  + roman-to-int |a }
multi roman-to-int('X',      |a) { 10  + roman-to-int |a }

multi roman-to-int('C', 'M', |a) { 900 + roman-to-int |a }
multi roman-to-int('C', 'D', |a) { 400 + roman-to-int |a }
multi roman-to-int('C',      |a) { 100 + roman-to-int |a }

multi roman-to-int($v,       |a) {
    roman-to-int(|a) + do given $v {
        when 'I' { 1 }
        when 'V' { 5 }
        when 'X' { 10 }
        when 'L' { 50 }
        when 'C' { 100 }
        when 'D' { 500 }
        when 'M' { 1000 }
    }
}


sub int-to-roman(Int \n) returns Str is cached {
    given n {
        when * >= 1000 { 'M'  ~ int-to-roman(n - 1000) }
        when * >= 900  { 'CM' ~ int-to-roman(n - 900) }
        when * >= 500  { 'D'  ~ int-to-roman(n - 500) }
        when * >= 400  { 'CD' ~ int-to-roman(n - 400) }
        when * >= 100  { 'C'  ~ int-to-roman(n - 100) }
        when * >= 90   { 'XC' ~ int-to-roman(n - 90) }
        when * >= 50   { 'L'  ~ int-to-roman(n - 50) }
        when * >= 40   { 'XL' ~ int-to-roman(n - 40) }
        when * >= 10   { 'X'  ~ int-to-roman(n - 10) }
        when * >= 9    { 'IX' ~ int-to-roman(n - 9) }
        when * >= 5    { 'V'  ~ int-to-roman(n - 5) }
        when * >= 4    { 'IV' ~ int-to-roman(n - 4) }
        when * >= 1    { 'I'  ~ int-to-roman(n - 1) }
        default        { '' }
    }
}


sub MAIN(Bool :$run-tests = False,
         Str  :$file      = $*SPEC.catdir($*PROGRAM-NAME.IO.dirname, 'roman.txt')) {

    return TEST if $run-tests;
    die "$file is missing" unless $file.IO.e;
    say [+] do for $file.IO.lines -> $line {
        $line.chars - (int-to-roman roman-to-int $line).chars;
    }
}

sub TEST {
    use Test;

    {
        my $i = roman-to-int("XXXXVIIII");
        ok roman-to-int(int-to-roman $i) == $i, "sanity test";
    }
    {
        my $i = (^1000).pick;
        ok roman-to-int(int-to-roman $i) == $i, "sanity test";
    }

    ok (roman-to-int("IIIIIIIIIIIIIIII") ==
        roman-to-int("VIIIIIIIIIII") ==
        roman-to-int("VVIIIIII") ==
        roman-to-int("XIIIIII") ==
        roman-to-int("VVVI") ==
        roman-to-int("XVI")), 'roman-to-int works';
    is int-to-roman(6666) , "MMMMMMDCLXVI", 'int-to-roman works';
    done;
}

# vim: expandtab shiftwidth=4 ft=perl6

See Also

prob001-cspencer.raku

Multiples of 3 and 5

prob001-eric256.raku

Multiples of 3 and 5

prob001-grondilu.raku

Multiples of 3 and 5

prob001-hexmode.raku

Multiples of 3 and 5

prob001-unobe.raku

Multiples of 3 and 5

prob002-eric256.raku

Even Fibonacci numbers

prob002-gerdr.raku

Even Fibonacci numbers

prob002-hexmode.raku

Even Fibonacci numbers

prob003-eric256.raku

Largest prime factor

prob003-gerdr.raku

Largest prime factor

prob003-hexmode.raku

Largest prime factor

prob003-lanny.raku

Largest prime factor

prob004-unobe.raku

Largest palindrome product

prob004-xfix.raku

Largest palindrome product

prob005-unobe.raku

Smallest multiple

prob005-xfix.raku

Smallest multiple

prob006-polettix.raku

Sum square difference

prob007-polettix.raku

10001st prime

prob008-duff.raku

Largest product in a series

prob008-duff2.raku

Largest product in a series

prob009-gerdr-feeds.raku

Special Pythagorean triplet

prob009-gerdr.raku

Special Pythagorean triplet

prob009-polettix.raku

Special Pythagorean triplet

prob010-polettix.raku

Summation of primes

prob011-moritz.raku

Largest product in a grid

prob012-polettix.raku

Highly divisible triangular number

prob013-grondilu.raku

Large sum

prob014-felher.raku

Longest Collatz sequence

prob015-felher.raku

Lattice paths

prob016-grondilu.raku

Power digit sum

prob017-duff.raku

Number letter counts

prob018-felher.raku

Maximum path sum I

prob019-grondilu.raku

Counting Sundays

prob020-grondilu.raku

Factorial digit sum

prob021-gerdr.raku

Amicable numbers

prob022-grondilu.raku

Names scores

prob023-shlomif.raku

Non-abundant sums

prob024-moritz.raku

Lexicographic permutations

prob025-polettix.raku

1000-digit Fibonacci number

prob026-shlomif.raku

Reciprocal cycles

prob027-shlomif.raku

Quadratic primes

prob028-shlomif.raku

Number spiral diagonals

prob029-gerdr.raku

Distinct powers

prob029-polettix.raku

Distinct powers

prob031-shlomif.raku

Coin sums

prob033-andreoss.raku

Digit cancelling fractions

prob034-quinny.raku

Digit factorials

prob036-xenu.raku

Double-base palindromes

prob038-andreoss.raku

Pandigital multiples

prob039-quinny.raku

Integer right triangles

prob041-heyajulia-alternative.raku

Pandigital Prime

prob041-heyajulia.raku

Pandigital Prime

prob042-shlomif.raku

Coded triangle numbers

prob047-gerdr.raku

Distinct primes factors

prob052-duff.raku

Permuted multiples

prob053-duff.raku

Combinatoric selections

prob053-gerdr.raku

Combinatoric selections

prob054-andreoss.raku

Poker hands

prob055-shlomif.raku

Lychrel numbers

prob056-shlomif.raku

prob059-andreoss.raku

XOR decryption

prob063-moritz.raku

Powerful digit counts

prob063-polettix.raku

Powerful digit counts

prob065-andreoss.raku

Convergents of e

prob065-grondilu.raku

prob066-andreoss.raku

Diophantine equation

prob067-felher.raku

Maximum path sum II

prob080-andreoss.raku

Square root digital expansion

prob081-moritz.raku

Path sum: two ways

prob092-moritz.raku

Square digit chains

prob097-andreoss.raku

Large non-Mersenne prime

prob098-andreoss.raku

Anagramic squares

prob099-andreoss.raku

Largest exponential

README.md

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

Built with Podlite — the markup and publishing tools behind this site.