Merge pull request #9823 from arnesom/branch-for-challenge-262

Arne Sommer

5 files changed, 69 insertions, 0 deletions

diff --git a/challenge-262/arne-sommer/blog.txt b/challenge-262/arne-sommer/blog.txt
new file mode 100644
index 0000000000..1cfff8ca55
--- /dev/null
+++ b/challenge-262/arne-sommer/blog.txt
@@ -0,0 +1 @@
+https://raku-musings.com/positively-equal.html
diff --git a/challenge-262/arne-sommer/raku/ch-1.raku b/challenge-262/arne-sommer/raku/ch-1.raku
new file mode 100755
index 0000000000..69d9069551
--- /dev/null
+++ b/challenge-262/arne-sommer/raku/ch-1.raku
@@ -0,0 +1,16 @@
+#! /usr/bin/env raku
+
+unit sub MAIN (*@ints where all(@ints) ~~ Int && @ints.elems > 0, :v(:$verbose));
+
+my $positive = (@ints.grep: * >  0).elems;
+my $negative = (@ints.grep: * <  0).elems;
+my $zero     = (@ints.grep: * == 0).elems;
+
+if $verbose
+{
+  say ": Count of positive integers: $positive";
+  say ": Count of negative integers: $negative";
+  say ": Count of zeroes: $zero";
+}
+
+say max($positive, $negative);
diff --git a/challenge-262/arne-sommer/raku/ch-2.raku b/challenge-262/arne-sommer/raku/ch-2.raku
new file mode 100755
index 0000000000..aaa9b1ca66
--- /dev/null
+++ b/challenge-262/arne-sommer/raku/ch-2.raku
@@ -0,0 +1,18 @@
+#! /usr/bin/env raku
+
+unit sub MAIN (Int $k, *@ints where all(@ints) ~~ Int && @ints.elems > 0, :v(:$verbose));
+
+my $count = 0;
+
+for 0 .. @ints.elems -2 -> $i
+{
+  for $i +1 .. @ints.elems -1 -> $j
+  {
+    next unless @ints[$i] == @ints[$j];
+    next unless $i * $j %% $k;
+    $count++;
+    say ": ($i, $j) => ints[$i] == ints[$j] == @ints[$j] and $i x $j = { $i * $j} is divisible by $k" if $verbose;
+  }
+}
+
+say $count;
diff --git a/challenge-262/arne-sommer/raku/count-equal-divisible b/challenge-262/arne-sommer/raku/count-equal-divisible
new file mode 100755
index 0000000000..aaa9b1ca66
--- /dev/null
+++ b/challenge-262/arne-sommer/raku/count-equal-divisible
@@ -0,0 +1,18 @@
+#! /usr/bin/env raku
+
+unit sub MAIN (Int $k, *@ints where all(@ints) ~~ Int && @ints.elems > 0, :v(:$verbose));
+
+my $count = 0;
+
+for 0 .. @ints.elems -2 -> $i
+{
+  for $i +1 .. @ints.elems -1 -> $j
+  {
+    next unless @ints[$i] == @ints[$j];
+    next unless $i * $j %% $k;
+    $count++;
+    say ": ($i, $j) => ints[$i] == ints[$j] == @ints[$j] and $i x $j = { $i * $j} is divisible by $k" if $verbose;
+  }
+}
+
+say $count;
diff --git a/challenge-262/arne-sommer/raku/max-positive-negative b/challenge-262/arne-sommer/raku/max-positive-negative
new file mode 100755
index 0000000000..69d9069551
--- /dev/null
+++ b/challenge-262/arne-sommer/raku/max-positive-negative
@@ -0,0 +1,16 @@
+#! /usr/bin/env raku
+
+unit sub MAIN (*@ints where all(@ints) ~~ Int && @ints.elems > 0, :v(:$verbose));
+
+my $positive = (@ints.grep: * >  0).elems;
+my $negative = (@ints.grep: * <  0).elems;
+my $zero     = (@ints.grep: * == 0).elems;
+
+if $verbose
+{
+  say ": Count of positive integers: $positive";
+  say ": Count of negative integers: $negative";
+  say ": Count of zeroes: $zero";
+}
+
+say max($positive, $negative);