Merge pull request #5302 from Scimon/master

Challenge 1

2 files changed, 24 insertions, 0 deletions

diff --git a/challenge-141/simon-proctor/raku/ch-1.raku b/challenge-141/simon-proctor/raku/ch-1.raku
new file mode 100644
index 0000000000..526bad0135
--- /dev/null
+++ b/challenge-141/simon-proctor/raku/ch-1.raku
@@ -0,0 +1,15 @@
+#!/usr/bin/env raku
+
+#| Find the first N positive integers with exactly X divisors
+sub MAIN(
+    \N = 10, #= Number of integers (default 10)
+    \X = 8, #= Number of divisors (default 8)
+) {
+    .say for (1..*).grep(
+        -> $v {
+            (1..$v).grep(
+                -> $d {
+                    $v %% $d
+                } ).elems == X
+        })[^N];
+}
diff --git a/challenge-141/simon-proctor/raku/ch-2.raku b/challenge-141/simon-proctor/raku/ch-2.raku
new file mode 100644
index 0000000000..1bb40b5556
--- /dev/null
+++ b/challenge-141/simon-proctor/raku/ch-2.raku
@@ -0,0 +1,9 @@
+#!/usr/bin/env raku
+
+#| Given a two number M and N find the number of "Like Numbers" can be found
+sub MAIN (
+    UInt \M, #= Integer used to make sub values
+    UInt \N  #= Integer subvales of M should be divisible by
+) {
+    M.comb.combinations(1..^(M.codes)).map( *.join() ).grep( * %% N ).elems.say;
+}