diff options
| author | Mohammad Sajid Anwar <Mohammad.Anwar@yahoo.com> | 2025-09-08 09:07:33 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-09-08 09:07:33 +0100 |
| commit | 6aca42494cd9799fc1b0404bbc1040b39a69f18d (patch) | |
| tree | 1f79d1aba945b0f39772f869a4f524a318327ae2 | |
| parent | 95e04a7f867f6cbebbaff4c6d67254a8f774abe1 (diff) | |
| parent | fe39fe9342c2b9ce025d160c4fdba5af58db55f9 (diff) | |
| download | perlweeklychallenge-club-6aca42494cd9799fc1b0404bbc1040b39a69f18d.tar.gz perlweeklychallenge-club-6aca42494cd9799fc1b0404bbc1040b39a69f18d.tar.bz2 perlweeklychallenge-club-6aca42494cd9799fc1b0404bbc1040b39a69f18d.zip | |
Merge pull request #12641 from ash/ash-338
Week 338, solutions in Raku by @ash
| -rw-r--r-- | challenge-338/ash/raku/ch-1.raku | 26 | ||||
| -rw-r--r-- | challenge-338/ash/raku/ch-2.raku | 12 |
2 files changed, 38 insertions, 0 deletions
diff --git a/challenge-338/ash/raku/ch-1.raku b/challenge-338/ash/raku/ch-1.raku new file mode 100644 index 0000000000..7c1d747559 --- /dev/null +++ b/challenge-338/ash/raku/ch-1.raku @@ -0,0 +1,26 @@ +# Task 1 of The Weekly Challenge 338 +# https://theweeklychallenge.org/blog/perl-weekly-challenge-338/#TASK1 + +say max-sum([[4, 4, 4, 4], + [10, 0, 0, 0], + [2, 2, 2, 9]]); # 16 + +say max-sum([[1, 5], + [7, 3], + [3, 5]]); # 10 + +say max-sum([[1, 2, 3], + [3, 2, 1]]); # 6 + +say max-sum([[2, 8, 7], + [7, 1, 3], + [1, 9, 5]]); # 17 + +say max-sum([[10, 20, 30], + [5, 5, 5], + [0, 100, 0], + [25, 25, 25]]); # 100 + +sub max-sum(*@matrix) { + @matrix>>.sum.max +} diff --git a/challenge-338/ash/raku/ch-2.raku b/challenge-338/ash/raku/ch-2.raku new file mode 100644 index 0000000000..5cbb72f41b --- /dev/null +++ b/challenge-338/ash/raku/ch-2.raku @@ -0,0 +1,12 @@ +# Task 2 of The Weekly Challenge 338 +# https://theweeklychallenge.org/blog/perl-weekly-challenge-338/#TASK2 + +say max-distance([4, 5, 7], [9, 1, 3, 4]); # 6 +say max-distance([2, 3, 5, 4], [3, 2, 5, 5, 8, 7]); # 6 +say max-distance([2, 1, 11, 3], [2, 5, 10, 2]); # 9 +say max-distance([1, 2, 3], [3, 2, 1]); # 2 +say max-distance([1, 0, 2, 3], [5, 0]); # 5 + +sub max-distance(@a, @b) { + ((@a X @b).map: {abs([-] $_)}).max +} |
