- Solution for Weekly Challenge 089 by Xliff

3 files changed, 38 insertions, 0 deletions

diff --git a/challenge-089/xliff/README b/challenge-089/xliff/README
new file mode 100644
index 0000000000..c9edc9a674
--- /dev/null
+++ b/challenge-089/xliff/README
@@ -0,0 +1 @@
+Solution by Clifton "Xliff" Wood
diff --git a/challenge-089/xliff/raku/ch-1.raku b/challenge-089/xliff/raku/ch-1.raku
new file mode 100755
index 0000000000..e576cdea92
--- /dev/null
+++ b/challenge-089/xliff/raku/ch-1.raku
@@ -0,0 +1,7 @@
+#!/usr/bin/env raku
+# Task 1
+
+my $n = prompt "Input: ";
+
+my $o = (1...$n).combinations(2).map({ .[0] gcd .[1] }).sum;
+say "Output: $o\n\n";
diff --git a/challenge-089/xliff/raku/ch-2.raku b/challenge-089/xliff/raku/ch-2.raku
new file mode 100755
index 0000000000..06d943299b
--- /dev/null
+++ b/challenge-089/xliff/raku/ch-2.raku
@@ -0,0 +1,30 @@
+#!/usr/bin/env raku
+
+# Task 2
+
+say 'This step will take a bit...';
+
+my @solutions = (1...9).permutations.grep({
+  [&&](
+    # Rows
+    .[0] + .[1] + .[2] == 15,
+    .[3] + .[4] + .[5] == 15,
+    .[6] + .[7] + .[8] == 15,
+
+    # Columns
+    .[0] + .[3] + .[6] == 15,
+    .[1] + .[4] + .[7] == 15,
+    .[2] + .[5] + .[8] == 15,
+
+    # Diagonals
+    .[0] + .[4] + .[8] == 15,
+    .[6] + .[4] + .[2] == 15
+  )
+});
+
+for @solutions {
+  say "[ { .[0] } { .[1] } { .[2] } ]" for .rotor(3);
+  say "\n";
+}
+
+say "Solution completed in { time - INIT time} seconds";