Merge remote-tracking branch 'upstream/master'

91 files changed, 4547 insertions, 1639 deletions

diff --git a/challenge-042/roger-bell-west/blog.txt b/challenge-042/roger-bell-west/blog.txt
new file mode 100644
index 0000000000..c10d17d6f2
--- /dev/null
+++ b/challenge-042/roger-bell-west/blog.txt
@@ -0,0 +1 @@
+https://blog.firedrake.org/archive/2020/02/Perl_Weekly_Challenge_42__octal_and_balancing_brackets.html
diff --git a/challenge-045/kevin-colyer/raku/ch-1.p6 b/challenge-045/kevin-colyer/raku/ch-1.p6
new file mode 100644
index 0000000000..cd80cf7cad
--- /dev/null
+++ b/challenge-045/kevin-colyer/raku/ch-1.p6
@@ -0,0 +1,66 @@
+#!/usr/bin/perl6
+use v6;
+
+use Test;
+
+
+=begin pod
+
+TASK #1
+Square Secret Code
+The squate secret code mechanism first removes any space from the original message. Then it lays down the message in a row of 8 columns. The coded message is then obtained by reading down the columns going left to right.
+
+For example, the message is “The quick brown fox jumps over the lazy dog”.
+
+Then the message would be laid out as below:
+
+thequick
+brownfox
+jumpsove
+rthelazy
+dog
+The code message would be as below:
+
+tbjrd hruto eomhg qwpe unsl ifoa covz kxey
+
+Write a script that accepts a message from command line and prints the equivalent coded message.
+
+
+=end pod
+
+multi MAIN(Str $plaintext) {
+    squareSecretEncode($plaintext).say
+}
+
+multi MAIN('test') {
+    is squareSecretEncode("The quick brown fox jumps over the lazy dog"),"tbjrd hruto eomhg qwpe unsl ifoa covz kxey","Encodes correctly";
+    done-testing;
+}
+
+sub squareSecretEncode(Str $plaintext) returns Str {
+    # transform to lowercase a-z only and remove spaces then split
+    my @t=$plaintext.lc.trans(['a'..'z'] => '', :complement).comb;
+    # calculate the rows in the 8x? grid
+    my $rows=(@t.elems + 8) div 8;
+
+    # gather the ciphered text - go over entire grid even though it may not fill entirely
+    my @c=gather for ^$rows*8 -> $i {
+        # transform the left to right array traversal to a down first then along
+        #      DOWN             ALONG
+        my $j=($i % $rows)*8  + $i div $rows;
+
+        # if we are over the end of the array take a space and loop
+        # could avoid this code if we add 8 spaces to end of array...
+        if $j>=@t.elems {
+            take " ";
+            next
+        };
+
+        # take the element at the translated position
+        take @t[$j];
+    }
+    # make a string from @c using rotor to combine every 5 elements (or less at end)...
+    # join the new list of 5 elems to a string...
+    # as the new string might have a space split on words and re-join with single space
+    ~@c.rotor(5,:partial)>>.join>>.words>>.join(" ");
+}
diff --git a/challenge-045/kevin-colyer/raku/ch-2.p6 b/challenge-045/kevin-colyer/raku/ch-2.p6
new file mode 100644
index 0000000000..8ad73f6dcd
--- /dev/null
+++ b/challenge-045/kevin-colyer/raku/ch-2.p6
@@ -0,0 +1,18 @@
+#!/usr/bin/perl6
+use v6;
+
+=begin pod
+
+TASK #2
+Source Dumper
+Write a script that dumps its own source code. For example, say, the script name is ch-2.pl then the following command should returns nothing.
+
+$ perl ch-2.pl | diff - ch-2.pl
+
+
+=end pod
+
+# $*PROGRAM has the IO.Path object of the program. I use print as this keeps the same number
+# of new lines as in the source (.say would add an extra one)
+slurp($*PROGRAM).print;
+
diff --git a/challenge-046/alicia-bielsa/perl/ch-1.pl b/challenge-046/alicia-bielsa/perl/ch-1.pl
new file mode 100644
index 0000000000..e2ff41d1b4
--- /dev/null
+++ b/challenge-046/alicia-bielsa/perl/ch-1.pl
@@ -0,0 +1,55 @@
+
+use strict;
+use warnings;
+use Data::Dumper;
+
+#Cryptic Message
+#The communication system of an office is broken and message received are not completely reliable. To send message Hello, it ended up sending these following:
+#
+#H x l 4 !
+#c e - l o
+#z e 6 l g
+#H W l v R
+#q 9 m # o
+#Similary another day we received a message repeatedly like below:
+#
+#P + 2 l ! a t o
+#1 e 8 0 R $ 4 u
+#5 - r ] + a > /
+#P x w l b 3 k \
+#2 e 3 5 R 8 y u
+#< ! r ^ ( ) k 0
+#Write a script to decrypt the above repeated message (one message repeated 6 times).
+#
+#HINT: Look for characters repeated in a particular position in all six messages received.
+
+my @aMessage1 = qw(P + 2 l ! a t o);
+my @aMessage2 = qw(1 e 8 0 R $ 4 u);
+my @aMessage3 = qw(5 - r ] + a > /);
+my @aMessage4 = qw(P x w l b 3 k \\);
+my @aMessage5 = qw(2 e 3 5 R 8 y u);
+my @aMessage6 = qw(< ! r ^ ( ) k 0);
+my @aCharactersRepeated = ();
+my $lengthMessage = scalar(@aMessage1);
+my @aAllMessages = (@aMessage1, @aMessage2 ,@aMessage3, @aMessage4, @aMessage5 ,@aMessage6);
+my %hCharacters = ();
+
+foreach my $indexAllMesages (0..$#aAllMessages){
+    my $indexMessage =  $indexAllMesages % $lengthMessage;
+    my $currentCharacter = $aAllMessages[$indexAllMesages];
+    unless (exists($hCharacters{$indexMessage})){
+        $hCharacters{$indexMessage} =();
+    }    
+    unless (exists($hCharacters{$indexMessage}{$currentCharacter})){
+        $hCharacters{$indexMessage}{$currentCharacter} = 0 ;
+    }
+    $hCharacters{$indexMessage}{$currentCharacter} ++;
+    if ($hCharacters{$indexMessage}{$currentCharacter} == 2 ){
+        $aCharactersRepeated[$indexMessage] = $currentCharacter;
+    }
+}
+print "Decrypted Message:";
+foreach my $character (@aCharactersRepeated){
+    print "$character";
+}
+print "\n";
diff --git a/challenge-046/alicia-bielsa/perl/ch-2.pl b/challenge-046/alicia-bielsa/perl/ch-2.pl
new file mode 100644
index 0000000000..26e3cefb6b
--- /dev/null
+++ b/challenge-046/alicia-bielsa/perl/ch-2.pl
@@ -0,0 +1,32 @@
+#Is the room open?
+#There are 500 rooms in a hotel with 500 employees having keys to all the rooms. 
+#The first employee opened main entrance door of all the rooms. The second employee then closed the doors of room numbers 2,4,6,8,10 and so on to 500. The third employee then closed the door if it was opened or opened the door if it was closed of rooms 3,6,9,12,15 and so on to 500. Similarly the fourth employee did the same as the third but only room numbers 4,8,12,16 and so on to 500. This goes on until all employees has had a turn.
+#
+#Write a script to find out all the rooms still open at the end.
+
+use strict;
+use warnings;
+
+my $TOTAL = 500;
+my @aRooms =  (0) x $TOTAL;	
+foreach my $employee (1..$TOTAL){
+    foreach my $door ($employee..$TOTAL){ 
+        if ($door % $employee == 0 ){            
+            $aRooms[$door-1] = flipStatus ($aRooms[$door-1]);
+        }
+    }
+}
+
+foreach my $room (0..$#aRooms){
+    if ($aRooms[$room]){
+        $room ++;
+        print "Room $room opened\n";    
+    }
+}
+sub flipStatus {
+    my $status = shift;
+    if ($status){
+        return 0;
+    } 
+    return 1;
+}
\ No newline at end of file
diff --git a/challenge-046/andrezgz/perl/ch-1.pl b/challenge-046/andrezgz/perl/ch-1.pl
new file mode 100644
index 0000000000..e2a16bcf71
--- /dev/null
+++ b/challenge-046/andrezgz/perl/ch-1.pl
@@ -0,0 +1,57 @@
+#!/usr/bin/perl
+
+# https://perlweeklychallenge.org/blog/perl-weekly-challenge-046/
+# Task #1
+# Cryptic Message
+# The communication system of an office is broken and message received
+# are not completely reliable. To send message Hello,
+# it ended up sending these following:
+#
+# H x l 4 !
+# c e - l o
+# z e 6 l g
+# H W l v R
+# q 9 m # o
+# Similary another day we received a message repeatedly like below:
+#
+# P + 2 l ! a t o
+# 1 e 8 0 R $ 4 u
+# 5 - r ] + a > /
+# P x w l b 3 k \
+# 2 e 3 5 R 8 y u
+# < ! r ^ ( ) k 0
+# Write a script to decrypt the above repeated message (one message repeated 6 times).
+#
+# HINT: Look for characters repeated in a particular position in all six messages received.
+
+use strict;
+use warnings;
+
+my $msg = [
+    [qw# P + 2 l ! a t o #],
+    [qw# 1 e 8 0 R $ 4 u #],
+    [qw# 5 - r ] + a > / #],
+    [qw# P x w l b 3 k \ #],
+    [qw# 2 e 3 5 R 8 y u #],
+    [qw# < ! r ^ ( ) k 0 #],
+];
+
+my $msg_len = scalar @{$msg->[0]};
+my @decrypted = ('?') x $msg_len;
+
+for my $i (1 .. @{$msg}-1) {
+    for my $j (0 .. $i-1) {
+        for (0 .. $msg_len-1) {
+            $decrypted[$_] = $msg->[$i]->[$_] if ($msg->[$i]->[$_] eq $msg->[$j]->[$_]);
+        }
+    }
+    print @decrypted,"\n";
+}
+
+__END__
+./ch-1.pl
+????????
+?????a??
+P??l?a??
+Pe?lRa?u
+PerlRaku
diff --git a/challenge-046/andrezgz/perl/ch-2.pl b/challenge-046/andrezgz/perl/ch-2.pl
new file mode 100644
index 0000000000..7a0e0c5565
--- /dev/null
+++ b/challenge-046/andrezgz/perl/ch-2.pl
@@ -0,0 +1,36 @@
+#!/usr/bin/perl
+
+# https://perlweeklychallenge.org/blog/perl-weekly-challenge-046/
+# Task #2
+# Is the room open?
+# There are 500 rooms in a hotel with 500 employees having keys to all the rooms.
+# The first employee opened main entrance door of all the rooms.
+# The second employee then closed the doors of room numbers 2,4,6,8,10 and so on to 500.
+# The third employee then closed the door if it was opened or opened the door
+# if it was closed of rooms 3,6,9,12,15 and so on to 500.
+# Similarly the fourth employee did the same as the third
+# but only room numbers 4,8,12,16 and so on to 500.
+# This goes on until all employees has had a turn.
+#
+# Write a script to find out all the rooms still open at the end.
+
+use strict;
+use warnings;
+
+use constant MAX => 500;
+
+my @rooms = (-1) x MAX; # all rooms are closed
+unshift @rooms, 0;      # add room "0" for simplicity
+
+foreach my $e (1 ..