Merge pull request #7660 from robbie-hatley/206

Robbie Hatley's Perl solutions for PWCC 206

3 files changed, 154 insertions, 0 deletions

diff --git a/challenge-206/robbie-hatley/blog.txt b/challenge-206/robbie-hatley/blog.txt
new file mode 100644
index 0000000000..e7eee3b304
--- /dev/null
+++ b/challenge-206/robbie-hatley/blog.txt
@@ -0,0 +1 @@
+https://hatley-software.blogspot.com/2023/03/robbie-hatleys-perl-solutions-to-weekly.html
\ No newline at end of file
diff --git a/challenge-206/robbie-hatley/perl/ch-1.pl b/challenge-206/robbie-hatley/perl/ch-1.pl
new file mode 100755
index 0000000000..ff65848577
--- /dev/null
+++ b/challenge-206/robbie-hatley/perl/ch-1.pl
@@ -0,0 +1,54 @@
+#! /usr/bin/perl
+# Robbie Hatley's Perl Solution to PWCC 206-1
+
+=pod
+
+Task 1: Shortest Time
+Submitted by: Mohammad S Anwar
+Write a program to find the shortest time between any two times in a given
+list of times, at least 2, in the 24-hour clock format HH:MM.
+Example 1:  Input: ("00:00", "23:55", "20:00")           Output: 5
+Example 2:  Input: ("01:01", "00:50", "00:57")           Output: 4
+Example 3:  Input: ("10:10", "09:30", "09:00", "09:55")  Output: 15
+
+=cut
+
+# IO NOTES:
+# NOTE: Input is by either built-in array-of-arrays, or @ARGV. If using @ARGV,
+#       the args should be a space-separated sequence of 'single-quoted' 24HR
+#       time strings of the form '00:23' (for 23min after midnight) or '15:32'
+#       (for 32min after 3PM). This sequence will be considered to be a single
+#       array of times.
+# NOTE: Output is to STDOUT and will be the shortest time duration.
+
+# PRELIMINARIES:
+use v5.36;
+$"=", ";
+
+# DEFAULT INPUTS:
+my @arrays = 
+(
+   ["00:00", "23:55", "20:00"], 
+   ["01:01", "00:50", "00:57"],
+   ["10:10", "09:30", "09:00", "09:55"]
+);
+
+# NON-DEFAULT INPUTS:
+if (@ARGV) {@arrays = ([@ARGV]);}
+
+# MAIN BODY OF SCRIPT:
+for (@arrays){
+   my @array = @{$_};
+   my @times = map {60*substr($_,0,2)+substr($_,3,2)} @array;
+   my @diffs; # elapsed times
+   for    ( my $i =    0   ; $i <= $#times - 1 ; ++$i ){
+      for ( my $j = $i + 1 ; $j <= $#times - 0 ; ++$j ){
+         my ($t1, $t2) = sort {$a<=>$b} ($times[$i], $times[$j]);
+         my $te = $t2 - $t1;
+         if ($te > 720) {$te = 1440 - $te} 
+         push @diffs, $te}}
+   my $mindiff = 720;
+   for (@diffs) {if ($_<$mindiff) {$mindiff=$_}}
+   say '';
+   say "Times: @array";
+   say "Shortest time difference = $mindiff minutes";}
\ No newline at end of file
diff --git a/challenge-206/robbie-hatley/perl/ch-2.pl b/challenge-206/robbie-hatley/perl/ch-2.pl
new file mode 100755
index 0000000000..b3bed1ea28
--- /dev/null
+++ b/challenge-206/robbie-hatley/perl/ch-2.pl
@@ -0,0 +1,99 @@
+#! /usr/bin/perl
+# Robbie Hatley's Perl Solution to PWCC 206-2
+
+=pod
+
+Task 2: Array Pairings
+Submitted by: Mohammad S Anwar
+Given an array of integers having even number of elements, find the
+maximum sum of the minimum of each pair.
+
+Example 1:  Input: (1,2,3,4)  Output: 4
+Pairings:
+(1,2) and (3,4). So min(1,2) + min(3,4) => 1 + 3 => 4
+(1,3) and (2,4). So min(1,3) + min(2,4) => 1 + 2 => 3
+(1,4) and (2,3). So min(1,4) + min(2,3) => 2 + 1 => 3
+So the maximum sum is 4.
+
+Example 2:  Input: (0,2,1,3)  Output: 2
+Pairings:
+(0,2) and (1,3). So min(0,2) + min(1,3) => 0 + 1 => 1
+(0,1) and (2,3). So min(0,1) + min(2,3) => 0 + 2 => 2
+(0,3) and (2,1). So min(0,3) + min(2,1) => 0 + 1 => 1
+So the maximum sum is 2.
+
+=cut
+
+# IO NOTES:
+# NOTE: Input is by either built-in array-of-arrays, or @ARGV. If using @ARGV,
+# the args should be a space-separated sequence of an even number of real numbers,
+# which will be interpreted as being a single array.
+# NOTE: Output is to STDOUT and will be the maximum sum of pair minimums.
+
+# PRELIMINARIES:
+use v5.36;
+use List::Util 'sum0', 'max';
+$"=", ";
+
+# DEFAULT INPUTS:
+my @arrays = ([1,2,3,4], [0,2,1,3]);
+
+# NON-DEFAULT INPUTS:
+if (@ARGV) {@arrays = ([@ARGV]);}
+
+# SUBROUTINES:
+
+sub MaxSumMinEasy($array=[]){
+   return 0 if 0 == scalar @{$array};
+   my @sorted = sort {$a<=>$b} @{$array};
+   my $asize  = scalar(@sorted);
+   die "Error in MaxSumMin(): array size not even.\n$!\n" if 0 != $asize % 2;
+   my @even_indices; push @even_indices, 2*$_ for 0..($asize/2-1);
+   return sum0(@sorted[@even_indices])}
+
+sub Pairings ($array=[], $pairs=[]){
+   state $recurse = 0;
+   die "Error in Pairings(): Over 50 levels of recursion!\n$!\n" if $recurse > 50;
+   state @pairings;
+   # Clear @pairings on first entry, else @pairings accumulates garbage:
+   @pairings = () if 0 == $recurse;
+   my $asize = scalar(@{$array});
+   die "Error in Pairings(): array size not even.\n$!\n" if 0 != $asize % 2;
+   if (0 == $asize){
+      push @pairings, $pairs;}
+   else{
+      for    ( my $i =    0   ; $i <= $asize - 2 ; ++$i ){
+         for ( my $j = $i + 1 ; $j <= $asize - 1 ; ++$j ){
+            my @recurse_array = @{$array};
+            my @recurse_pairs = @{$pairs};
+            my $p2 = splice @recurse_array, $j, 1; # $j MUST come first!!!
+            my $p1 = splice @recurse_array, $i, 1; # Can you see why?
+            push @recurse_pairs, [$p1, $p2];
+            ++$recurse;
+            Pairings(\@recurse_array, \@recurse_pairs);
+            --$recurse}}}
+   return \@pairings}
+
+sub SumMin($pairing=[]){
+   return sum0 map {(sort {$a<=>$b} @{$_})[0]} @{$pairing}}
+
+sub MaxSumMinHard($pairings=[]){
+   return max map {SumMin $_} @{$pairings};}
+
+# MAIN BODY OF SCRIPT:
+for (@arrays){
+   my $array = $_;
+   my $msme = MaxSumMinEasy($array);
+   my $pairings = Pairings($array);
+   my $numpai = scalar @{$pairings};
+   my $msmh = MaxSumMinHard($pairings);
+   say '';
+   say "array: (@{$array})";
+   say 'Pairings:';
+   for (@{$pairings}){        # For each pairing
+      for (@{$_}){            # For each pair
+         print " [$_->[0],$_->[1]]";}
+      print "  ", SumMin($_), "\n";}
+   say "$numpai pairings";
+   say "max-sum-min-easy = $msme";
+   say "max-sum-min-hard = $msmh"}
\ No newline at end of file