diff options
| -rw-r--r-- | challenge-344/0rir/raku/ch-1.raku | 56 | ||||
| -rw-r--r-- | challenge-344/0rir/raku/ch-2.raku | 122 |
2 files changed, 178 insertions, 0 deletions
diff --git a/challenge-344/0rir/raku/ch-1.raku b/challenge-344/0rir/raku/ch-1.raku new file mode 100644 index 0000000000..e82dca6c44 --- /dev/null +++ b/challenge-344/0rir/raku/ch-1.raku @@ -0,0 +1,56 @@ +#!/usr/bin/env raku +# :vim ft=raku sw=4 expandtab # 🦋 ∅∪∩∋∈∉⊆ ≡ ≢ « » ∴ 🐧 +use v6.d; +use Test; + +=begin comment +Edited for space. +344-Task 1: Array Form Compute Submitted by: Mohammad Sajid Anwar + +You are given an array of integers, @ints and an integer, $x. + +Write a script to add $x to the integer in the array-form. + +The array form of an integer is a digit-by-digit representation stored as an array, where the most significant digit is at the 0th index. +=end comment + +my @Test = + # @in $i @exp + [1, 2, 3, 4], 12, (1, 2, 4, 6), + [2, 7, 4], 181, (4, 5, 5), + [9, 9, 9], 1, (1, 0, 0, 0), + [1, 0, 0, 0, 0], 9999, (1, 9, 9, 9, 9), + [0,], 1000, (1, 0, 0, 0), + + [9, 9, 9], 9999, (1, 0, 9, 9, 8) +; +plan +@Test ÷ 3; + +# Treat @l (of digits) as an integer to add the digits of $b to it. +only task( @l where * ⊆ ^10, Any(Int) $b) { + my @ret; + my @r = $b.comb».Int; + + my ($lr, $l, $r, $carry) = 0 xx 4;; + while @r or @l { + $l = @l ?? @l.pop !! 0; + $r = @r ?? @r.pop !! 0; + $lr = $r + $l + $carry; + $carry = $lr div 10; + $lr %= 10; + @ret.unshift: $lr; + } + @ret.unshift( $carry) if $carry; + @ret; +} + +for @Test -> @in, $i, @exp { + is task( @in, $i, ), @exp, "{@exp // @exp.^name()} <- @in.raku() ∘∘ $i"; +} +done-testing; + +my @int = [9, 9, 9]; +my $x = 99999; + +say "\nInput: @int = @int.raku(), \$x = $x\nOutput: ", task @int, $x; + diff --git a/challenge-344/0rir/raku/ch-2.raku b/challenge-344/0rir/raku/ch-2.raku new file mode 100644 index 0000000000..fe8ab88af0 --- /dev/null +++ b/challenge-344/0rir/raku/ch-2.raku @@ -0,0 +1,122 @@ +#!/usr/bin/env raku, +# :vim ft=raku sw=4 expandtab # 🦋 ∅∪∩∋∈∉⊆ ≡ ≢ « » ∴ 🐧 +use v6.e.PREVIEW; +use Test; +#use MONKEY-SEE-NO-EVAL; # unnecessary w/ Test module + + +=begin comment +Edited for space. +344-Task 2: Array Formation +Submitted by: Mohammad Sajid Anwar +You are given two list: @source and @target. + +Write a script to see if you can build the exact @target by putting these smaller lists from @source together in some order. You cannot break apart or change the order inside any of the smaller lists in @source. + +Input: @source = ([2,3], [1], [4]) + @target = (1, 2, 3, 4) +Output: true +Use in the order: [1], [2,3], [4] + +Example 2 +Input: @source = ([1,3], [2,4]) + @target = (1, 2, 3, 4) +Output: false + +Example 3 +Input: @source = ([9,1], [5,8], [2]) + @target = (5, 8, 2, 9, 1) +Output: true + +Use in the order: [5,8], [2], [9,1] + +Example 4 +Input: @source = ([1], [3]) + @target = (1, 2, 3) +Output: false + +Missing number: 2 + +Example 5 +Input: @source = ([7,4,6]) + @target = (7, 4, 6) +Output: true + +Use in the order: [7, 4, 6] +=end comment + +my @Test = + # @src @targ $exp + # one chunk + ( ['abc'],), <a b c>, True, + ( ['abc'],), <a c b>, False, + ( ['abc'],), <a b>, False, + # size mismatch + ([1], [3]), (1, 2, 3), False, # given + ([7,4,6,4]), (7, 4, 6), False, + ([7,4,6,4]), (7, 4, 6, 4, 4), False, + # all chunks one loca + ([2,3], [1], [4]), (1, 2, 3, 4), True, # given + ([9,1], [5,8], [2]), (5, 8, 2, 9, 1), True, # given + + # analyze -- with multi loca + (['a'], ['a'], ['a','a']), <a a a a>, True, + ([7,4,6,4]), (7, 4, 6,4), True, + + # top level no match + ([9,1,1], [5,8], [2]), (1, 5, 8, 2, 9, 1), False, + ([1,3], [2,4]), (1, 2, 3, 4), False, # given + + + ([7,4,6]), (7, 4, 6), True, # given + + + # have one-loca and multi-locae words + ([4],[7],[6,4],[4]), (7, 4, 6, 4, 4), True, + ([2,3], [1], [2,3], [4]), (1, 2, 3, 4, 2,3), True, +; + +plan @Test ÷ 3; + +sub task( @have, @want -->Bool) { + + # quick checks + if 1 == +@have { + return @want.join eq @have[0].join ?? True !! False; + } + # check matching size and chars + return False unless @have.flat( :hammer).sort ~~ @want.sort; + + # restructure inputs + my @word = @have.map: { $_.elems > 0 ?? .join !! $_}; + my $goal = @want.join; + + # taint check + @word.join ~~ m/ [<:L> | <:Nd>]+/; + + # Build a grammar + my $code = 'grammar { + rule TOP { ^ <word>+ $ } + token word {'; + + $code ~= " | $_" for @word; + $code ~= " }\n}\n"; + + my $gram-obj = (EVAL $code).new; + so $gram-obj.parse: $goal; +} + +for @Test -> @in, @want, $exp { + is task( @in, @want), $exp, + "{$exp // $exp.^name()} <- @in.raku() ∘∘ @want.raku()"; +} +done-testing; + +my @source = [[7,4,6], 7, 7, [7,1,2], 7, [7,1,7], 7]; +my @target = 7, 7,4,6, 7, 1,2,7, 7, 1,7,7, 7; + +say "\nInput: @source = @source.raku()\n @target = @target.raku()\n" + ~ "Output: ", lc task @source, @target; + + + |