Merge pull request #8978 from PerlBoy1967/branch-for-challenge-241

w241 - Task 1 & 2

3 files changed, 135 insertions, 0 deletions

diff --git a/challenge-241/perlboy1967/perl/ch1.pl b/challenge-241/perlboy1967/perl/ch1.pl
new file mode 100755
index 0000000000..dacf68a262
--- /dev/null
+++ b/challenge-241/perlboy1967/perl/ch1.pl
@@ -0,0 +1,46 @@
+#!/bin/perl
+
+=pod
+
+The Weekly Challenge - 241
+- https://theweeklychallenge.org/blog/perl-weekly-challenge-241
+
+Author: Niels 'PerlBoy' van Dijke
+
+Task 1: Arithmetic Triplets
+Submitted by: Mohammad S Anwar
+
+You are given an array (3 or more members) of integers in increasing order and a positive integer.
+
+Write a script to find out the number of unique Arithmetic Triplets satisfying the following rules:
+
+a) i < j < k
+b) nums[j] - nums[i] == diff
+c) nums[k] - nums[j] == diff
+
+=cut
+
+use v5.32;
+use common::sense;
+
+use Test2::V0;
+
+sub nArithmeticTriplets (\@$) {
+  my ($arL,$diff) = @_;
+  my $n = 0;
+
+  for my $i (0 .. $arL->$#* - 2) {
+    for my $j ($i + 1 .. $arL->$#* - 1) {
+      for my $k ($j + 1 .. $arL->$#*) {
+        $n++ if ($$arL[$j] - $$arL[$i] == $diff == $$arL[$k] - $$arL[$j]);
+      }
+    }
+  }
+
+  return $n;
+}
+
+is(nArithmeticTriplets(@{[0,1,4,6,7,10]},3), 2);
+is(nArithmeticTriplets(@{[4,5,6,7,8,9]},2), 2);
+
+done_testing;
diff --git a/challenge-241/perlboy1967/perl/ch2.pl b/challenge-241/perlboy1967/perl/ch2.pl
new file mode 100755
index 0000000000..2d79bcd7ea
--- /dev/null
+++ b/challenge-241/perlboy1967/perl/ch2.pl
@@ -0,0 +1,50 @@
+#!/bin/perl
+
+=pod
+
+The Weekly Challenge - 241
+- https://theweeklychallenge.org/blog/perl-weekly-challenge-241
+
+Author: Niels 'PerlBoy' van Dijke
+
+Task 2: Prime Order
+Submitted by: Mohammad S Anwar
+
+You are given an array of unique positive integers greater than 2.
+
+Write a script to sort them in ascending order of the count of their prime factors, tie-breaking
+by ascending value.
+
+=cut
+
+use v5.32;
+use common::sense;
+
+use Math::Prime::Util qw(factor);
+
+use Test2::V0;
+
+sub _cmpLists (\@\@) {
+  my $r = 0;
+
+  for (1 .. $_[0]->$#*) {
+    $r = $_[0]->[$_] <=> $_[1]->[$_];
+    return $r if $r != 0;
+  }
+
+  return 0;
+}
+
+sub primeOrder (@) {
+  map { $_->[0] } sort { 
+    scalar(@$a) <=> scalar(@$b)
+                || 
+            _cmpLists(@{$a},@{$b}) 
+  } map { [$_, factor($_)] } @_;
+
+}
+
+is([primeOrder(11,8,27,4)],[11,4,8,27]);
+is([primeOrder(15,3,4,2,12)],[2,3,4,15,12]);
+
+done_testing;
diff --git a/challenge-241/perlboy1967/perl/ch2a.pl b/challenge-241/perlboy1967/perl/ch2a.pl
new file mode 100755
index 0000000000..f7063ddb4d
--- /dev/null
+++ b/challenge-241/perlboy1967/perl/ch2a.pl
@@ -0,0 +1,39 @@
+#!/bin/perl
+
+=pod
+
+The Weekly Challenge - 241
+- https://theweeklychallenge.org/blog/perl-weekly-challenge-241
+
+Author: Niels 'PerlBoy' van Dijke
+
+Task 2: Prime Order
+Submitted by: Mohammad S Anwar
+
+You are given an array of unique positive integers greater than 2.
+
+Write a script to sort them in ascending order of the count of their prime factors, tie-breaking
+by ascending value.
+
+=cut
+
+use v5.32;
+use common::sense;
+
+use Math::Prime::Util qw(factor);
+
+use Test2::V0;
+
+sub primeOrder (@) {
+  map { $$_[0] } sort {
+    $a->$#* <=> $b->$#*
+            ||
+    $a->[0] <=> $b->[0]
+  } map { [$_, factor($_)] } @_;
+
+}
+
+is([primeOrder(11,8,27,4)],[11,4,8,27]);
+is([primeOrder(15,3,4,2,12)],[2,3,4,15,12]);
+
+done_testing;