Merge pull request #5097 from Scimon/master

Here we go :)

2 files changed, 22 insertions, 0 deletions

diff --git a/challenge-136/simon-proctor/raku/ch-1.raku b/challenge-136/simon-proctor/raku/ch-1.raku
new file mode 100644
index 0000000000..71ac8237ac
--- /dev/null
+++ b/challenge-136/simon-proctor/raku/ch-1.raku
@@ -0,0 +1,7 @@
+#!/usr/bin/env raku
+
+#| Given to Integers m and n find if they are friendly numbers
+sub MAIN( UInt \m, UInt \n ) {
+    my \v = m gcd n;
+    (1,2,* * 2...* > v).first(* == v).Bool.Int.say;
+}
diff --git a/challenge-136/simon-proctor/raku/ch-2.raku b/challenge-136/simon-proctor/raku/ch-2.raku
new file mode 100644
index 0000000000..da1b3028cb
--- /dev/null
+++ b/challenge-136/simon-proctor/raku/ch-2.raku
@@ -0,0 +1,15 @@
+#!/usr/bin/env raku
+
+my %*SUB-MAIN-OPTS = :named-anywhere;
+
+#| Given an integer N print the number of different combinations of Fibonacci numbers that sum to it.
+sub MAIN ( UInt \N,
+           Bool :v($verbose) = False #= Print the list of values
+         ) {
+    my @res = (1,1,*+*...* > N).unique.combinations.grep(
+                  -> @f { ([+] @f) == N }
+              );
+    say @res.elems;
+    say '---' if $verbose;
+    (.join(", ").say for @res) if $verbose;
+}