diff options
| -rw-r--r-- | challenge-262/bruce-gray/raku/ch-1.raku | 19 | ||||
| -rw-r--r-- | challenge-262/bruce-gray/raku/ch-2.raku | 29 |
2 files changed, 48 insertions, 0 deletions
diff --git a/challenge-262/bruce-gray/raku/ch-1.raku b/challenge-262/bruce-gray/raku/ch-1.raku new file mode 100644 index 0000000000..e8dfa9543a --- /dev/null +++ b/challenge-262/bruce-gray/raku/ch-1.raku @@ -0,0 +1,19 @@ +sub task1 ( @ns --> UInt ) { + my ( $negatives, $zeros, $positives ) = @ns».sign.Bag{-1, 0, 1}; + + if $zeros { + warn "One or more `0` was found in the input, and the task was not clear on how they were to be treated."; + } + + return $negatives max $positives; +} + + +use Test; plan +constant @tests = + ( 4, ( -3, 1, 2, -1, 3, -2, 4 ) ), + ( 3, ( -1, -2, -3, 1 ) ), + ( 2, ( 1, 2 ) ), +; +for @tests -> ( $expected, @in ) { + is task1( @in ), $expected; +} diff --git a/challenge-262/bruce-gray/raku/ch-2.raku b/challenge-262/bruce-gray/raku/ch-2.raku new file mode 100644 index 0000000000..64cb475af2 --- /dev/null +++ b/challenge-262/bruce-gray/raku/ch-2.raku @@ -0,0 +1,29 @@ +sub task2 ( UInt $k, @ns --> UInt ) { + # Concise, but always O(N²) : + # return +grep { ([*] .list) %% $k and ([==] @ns[.list]) }, combinations(+@ns, 2); + + sub wanted ( ($i, $j) --> Bool ) { ($i × $j) %% $k } + + sub combin_count (@indexes) { @indexes.combinations(2).grep(&wanted).elems } + + return @ns.pairs.classify( *.value, :as{.key} ).map({ combin_count(.value) }).sum; +} + + +constant @n1_1000 = 1 .. 1000; # Best case; no .combinations() at all when no elements are equal. +constant @n10_100 = |(41..50) xx 100; +constant @n42_43 = |(42 xx 500), |(43 xx 500); +constant @n42 = 42 xx 1000; # Worst case; O(N²) when all elements are identical +use Test; plan +constant @tests = + ( 4, 2, (3,1,2,2,2,1,3) ), + ( 0, 1, (1,2,3) ), + + ( 0, 2, @n1_1000 ), + ( 24750, 2, @n10_100 ), + ( 187250, 2, @n42_43 ), + ( 374750, 2, @n42 ), + ( 1000*999/2, 1, @n42 ), +; +for @tests -> ( $expected, $k, @in ) { + is task2( $k, @in ), $expected; +} |