From d7b0ff91b6c9d1ac34a4b23b46e565dc16e6c1f8 Mon Sep 17 00:00:00 2001
From: Luca Ferrari <fluca1978@gmail.com>
Date: Mon, 15 Mar 2021 09:00:38 +0100
Subject: Task 1 done

---
 challenge-104/luca-ferrari/raku/ch-1.p6 | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 challenge-104/luca-ferrari/raku/ch-1.p6

diff --git a/challenge-104/luca-ferrari/raku/ch-1.p6 b/challenge-104/luca-ferrari/raku/ch-1.p6
new file mode 100644
index 0000000000..723ca7793a
--- /dev/null
+++ b/challenge-104/luca-ferrari/raku/ch-1.p6
@@ -0,0 +1,20 @@
+#!raku
+
+# fusc(0) = 0
+# fusc(1) = 1
+# for n > 1:
+# when n is even: fusc(n) = fusc(n / 2),
+# when n is odd: fusc(n) = fusc((n-1)/2) + fusc((n+1)/2)
+
+
+multi sub fusc( 0 ) { 0 }
+multi sub fusc( 1 ) { 1 }
+multi sub fusc( $n where { $n > 1 } ) {
+    return samewith( ( $n / 2 ).Int ) if $n %% 2;
+    return samewith( ( ( $n - 1 ) / 2 ).Int ) + samewith( ( ( $n + 1 ) / 2 ).Int );
+}
+
+
+sub MAIN(){
+    "fusc( $_ ) = { fusc( $_ )}".say for 0 .. 10;
+}
-- 
cgit 


From e94c3e189426bdf3b67adf7ea903134efdd545e5 Mon Sep 17 00:00:00 2001
From: Luca Ferrari <fluca1978@gmail.com>
Date: Mon, 15 Mar 2021 09:13:05 +0100
Subject: Task 2 done

---
 challenge-104/luca-ferrari/raku/ch-2.p6 | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 challenge-104/luca-ferrari/raku/ch-2.p6

diff --git a/challenge-104/luca-ferrari/raku/ch-2.p6 b/challenge-104/luca-ferrari/raku/ch-2.p6
new file mode 100644
index 0000000000..660c217643
--- /dev/null
+++ b/challenge-104/luca-ferrari/raku/ch-2.p6
@@ -0,0 +1,27 @@
+#!raku
+
+# a) You have 12 tokens
+#    b) Each player can pick 1, 2 or 3 tokens at a time
+#                                 c) The player who picks the last token wins the game
+
+
+sub MAIN() {
+    # all tokens are True-selectable
+    my @tokens = True xx 12;
+
+    my @players = <Player1 Player2>;
+
+    while ( @tokens.elems > 0 ) {
+        for @players -> $player {
+            my $how-many = ( 1 .. min( 3, @tokens.elems ) ).pick;
+            @tokens.pop for 1 .. $how-many;
+            say "$player picks $how-many, remaining { @tokens.elems }";
+
+            if @tokens.elems == 0 && $how-many > 0 {
+                "Player $player won!".say && exit;
+            }
+        }
+
+    }
+
+}
-- 
cgit 


From d49b98c6e078c0aa5c59e952efc8c8c772d79552 Mon Sep 17 00:00:00 2001
From: Luca Ferrari <fluca1978@gmail.com>
Date: Mon, 15 Mar 2021 09:27:44 +0100
Subject: Blog references

---
 challenge-104/luca-ferrari/blog-1.txt | 1 +
 challenge-104/luca-ferrari/blog-2.txt | 1 +
 2 files changed, 2 insertions(+)
 create mode 100644 challenge-104/luca-ferrari/blog-1.txt
 create mode 100644 challenge-104/luca-ferrari/blog-2.txt

diff --git a/challenge-104/luca-ferrari/blog-1.txt b/challenge-104/luca-ferrari/blog-1.txt
new file mode 100644
index 0000000000..ab103a6810
--- /dev/null
+++ b/challenge-104/luca-ferrari/blog-1.txt
@@ -0,0 +1 @@
+https://fluca1978.github.io/2021/03/15/PerlWeeklyChallenge104.html#task1
diff --git a/challenge-104/luca-ferrari/blog-2.txt b/challenge-104/luca-ferrari/blog-2.txt
new file mode 100644
index 0000000000..2dfda9c979
--- /dev/null
+++ b/challenge-104/luca-ferrari/blog-2.txt
@@ -0,0 +1 @@
+https://fluca1978.github.io/2021/03/15/PerlWeeklyChallenge104.html#task2
-- 
cgit 


From 18b5f3975cfa1a564f5953dac6ef844576742d0d Mon Sep 17 00:00:00 2001
From: Simon Proctor <simon.proctor@gmail.com>
Date: Mon, 15 Mar 2021 09:06:00 +0000
Subject: FUSC sequence

---
 challenge-104/simon-proctor/raku/ch-1.raku | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 challenge-104/simon-proctor/raku/ch-1.raku

diff --git a/challenge-104/simon-proctor/raku/ch-1.raku b/challenge-104/simon-proctor/raku/ch-1.raku
new file mode 100644
index 0000000000..b4bedc3cc1
--- /dev/null
+++ b/challenge-104/simon-proctor/raku/ch-1.raku
@@ -0,0 +1,15 @@
+#!/usr/bin/env raku
+
+
+subset Even of Any where { $_ %% 2 };
+subset Odd of Any where { $_ !%% 2 };
+
+multi sub fusc($ where * == 0) { 0 }
+multi sub fusc($ where * == 1) { 1 }
+multi sub fusc(Even \n) { fusc( n / 2 ) }
+multi sub fusc(Odd \n) { fusc( (n-1)/2 ) + fusc( (n+1)/2 ) }
+
+#| Generate the first n FUSC numbers
+sub MAIN( UInt \n ) {
+    (0..^n).map( { fusc($_) } ).join(", ").say;
+}
-- 
cgit 


From dcf2605ec4f2ce6466316bdd06f7023eb2d9a2b9 Mon Sep 17 00:00:00 2001
From: Alexander Karelas <karjala@cpan.org>
Date: Mon, 15 Mar 2021 11:14:43 +0200
Subject: solutions

---
 challenge-104/alexander-karelas/perl/ch-1.pl | 19 ++++++++++
 challenge-104/alexander-karelas/perl/ch-2.pl | 52 ++++++++++++++++++++++++++++
 2 files changed, 71 insertions(+)
 create mode 100755 challenge-104/alexander-karelas/perl/ch-1.pl
 create mode 100755 challenge-104/alexander-karelas/perl/ch-2.pl

diff --git a/challenge-104/alexander-karelas/perl/ch-1.pl b/challenge-104/alexander-karelas/perl/ch-1.pl
new file mode 100755
index 0000000000..14b2188772
--- /dev/null
+++ b/challenge-104/alexander-karelas/perl/ch-1.pl
@@ -0,0 +1,19 @@
+#!/usr/bin/env perl
+
+use v5.30;
+use warnings;
+
+use experimental 'signatures';
+
+sub fusc ($n) {
+    return $n if $n <= 1;
+    if ($n % 2 == 0) {
+        return fusc($n / 2);
+    } else {
+        return fusc(($n - 1) / 2) + fusc(($n + 1) / 2);
+    }
+}
+
+for (my $i = 0; $i < 50; $i++) {
+    say $i, ": ", fusc($i);
+}
\ No newline at end of file
diff --git a/challenge-104/alexander-karelas/perl/ch-2.pl b/challenge-104/alexander-karelas/perl/ch-2.pl
new file mode 100755
index 0000000000..933a4ff87a
--- /dev/null
+++ b/challenge-104/alexander-karelas/perl/ch-2.pl
@@ -0,0 +1,52 @@
+#!/usr/bin/env perl
+
+use v5.30;
+use warnings;
+
+use experimental 'signatures';
+
+use List::Util 'max', 'min';
+
+sub position_value ($n) {
+    if ($n == 0) {
+        return -1;
+    }
+
+    my @move_values;
+    for my $move (1 .. min(3, $n)) {
+        $move_values[$move] = - position_value($n - $move);
+    }
+
+    return max(grep defined, @move_values);
+}
+
+sub best_move ($n) {
+    my $pos_value = position_value($n);
+    my @best_moves = grep position_value($n - $_) == - $pos_value, (1 .. min(3, $n));
+    return $best_moves[int rand @best_moves];
+}
+
+my $num_sticks = 12;
+
+print "Who plays first? You or computer? (y/c): ";
+chomp(my $player = <STDIN>);
+
+while ($num_sticks > 0) {
+    say "$num_sticks sticks remain.";
+    my $num_pick;
+    if ($player eq 'c') {
+        $num_pick = best_move($num_sticks);
+        say "I pick $num_pick.";
+    } else {
+        print "How many do you pick? ";
+        chomp($num_pick = <STDIN>);
+    }
+    $num_sticks -= $num_pick;
+    $player = $player eq 'c' ? 'y' : 'c';
+}
+
+if ($player eq 'y') {
+    say "Computer wins!";
+} else {
+    say "You win";
+}
-- 
cgit 


From 9e86d8945acde5d75a3fbc69ad4f222a6d290a3b Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 15 Mar 2021 10:02:40 +0000
Subject: push ch104

---
 challenge-104/james-smith/perl/ch-1.pl | 42 ++++++++++++++++++++++++++++++++++
 challenge-104/james-smith/perl/ch-2.pl | 41 +++++++++++++++++++++++++++++++++
 2 files changed, 83 insertions(+)
 create mode 100644 challenge-104/james-smith/perl/ch-1.pl
 create mode 100644 challenge-104/james-smith/perl/ch-2.pl

diff --git a/challenge-104/james-smith/perl/ch-1.pl b/challenge-104/james-smith/perl/ch-1.pl
new file mode 100644
index 0000000000..900a4a5919
--- /dev/null
+++ b/challenge-104/james-smith/perl/ch-1.pl
@@ -0,0 +1,42 @@
+#!/usr/local/bin/perl
+
+use strict;
+
+use warnings;
+use feature qw(say state);
+use Test::More;
+
+my @known = (0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9, 7, 12, 5, 13, 8, 11, 3, 10, 7, 11, 4, 9, 5, 6, 1, 7, 6, 11, 5, 14, 9, 13, 4, 15, 11, 18, 7, 17, 10, 13, 3, 14, 11, 19, 8, 21, 13, 18, 5, 17, 12, 19);
+
+subtest 'fusc_seq' => sub {
+  is( join(' ',fusc_seq($_)), join ' ',@known[0..$_-1] ) foreach 0..@known-1;
+  done_testing();
+};
+
+subtest 'fusc' => sub {
+  is( fusc($_),               $known[$_-1]             ) foreach 1..@known-1;
+  done_testing();
+};
+
+done_testing();
+say join ' ',fusc_seq(50);
+
+sub fusc {
+  my $n = shift;
+  (fusc_seq($n))[$n-1];
+}
+
+sub fusc_seq {
+  my $n = shift;
+  return 0..$n-1 if $n<2;
+  my @seq = (0,1,1); ## We need to use one more seed value as the 5th entry
+                     ## when we pushed it needs the 3rd one before it can
+                     ## push as we are pushing two at a time...
+
+  ## We can simplify the code by pushing two entries onto the list each time...
+  push @seq, $seq[$_]+$seq[$_+1], $seq[$_+1] foreach 1..$n/2-1;
+
+  ## and if odd we just remove the last one we added...
+  pop @seq unless $n%2;
+  return @seq;
+}
diff --git a/challenge-104/james-smith/perl/ch-2.pl b/challenge-104/james-smith/perl/ch-2.pl
new file mode 100644
index 0000000000..6dd73eaf7e
--- /dev/null
+++ b/challenge-104/james-smith/perl/ch-2.pl
@@ -0,0 +1,41 @@
+#!/usr/local/bin/perl
+
+use strict;
+
+use warnings;
+use feature qw(say);
+use Test::More;
+
+## This simulates a game with random selects....
+simulate() foreach 1..10;
+## This simulates a game where player 1 takes a random number of token(s)
+## Then player to takes the optimal number of tokens... to guarentee a win...
+simulate_player2() foreach 1..10;
+
+sub simulate_player2 {
+  my $tokens = 12;
+  while(1) {
+    my $n = 1 + int rand 3;
+    $tokens -= $n;
+    say "Player 1 takes $n token(s) and leaves $tokens token(s)";
+    $n = 4-$n;
+    print "Player 2 takes $n token(s) and ";
+    $tokens -= $n;
+    last unless $tokens;
+    say "leaves $tokens tokens";
+  }
+  say "wins...\n";
+}
+
+sub simulate {
+  my($tokens,$player,$n) = (12,1,'');
+  while(1) {
+    $n = 1 + int rand 3;
+    last if $n >= $tokens;
+    $tokens-=$n;
+    say "Player $player takes $n token(s) and leaves $tokens token(s)";
+    $player = 3-$player;
+  }
+  say "Player $player takes the last $n token(s) and wins...\n";
+}
+
-- 
cgit 


From ea81c1e0ae61c63821b9411d9ec53bdb82d5addc Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 15 Mar 2021 11:34:24 +0000
Subject: added caching version of the seq function to speed up multiple calls

---
 challenge-104/james-smith/perl/ch-1.pl | 38 +++++++++++++++++++++++++++-------
 1 file changed, 31 insertions(+), 7 deletions(-)

diff --git a/challenge-104/james-smith/perl/ch-1.pl b/challenge-104/james-smith/perl/ch-1.pl
index 900a4a5919..1edbf506e4 100644
--- a/challenge-104/james-smith/perl/ch-1.pl
+++ b/challenge-104/james-smith/perl/ch-1.pl
@@ -6,19 +6,32 @@ use warnings;
 use feature qw(say state);
 use Test::More;
 
-my @known = (0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9, 7, 12, 5, 13, 8, 11, 3, 10, 7, 11, 4, 9, 5, 6, 1, 7, 6, 11, 5, 14, 9, 13, 4, 15, 11, 18, 7, 17, 10, 13, 3, 14, 11, 19, 8, 21, 13, 18, 5, 17, 12, 19);
+my @K = (0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5,
+         4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9,
+         4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9, 7, 12,
+         5, 13, 8, 11, 3, 10, 7, 11, 4, 9, 5, 6, 1, 7, 6, 11,
+         5, 14, 9, 13, 4, 15, 11, 18, 7, 17, 10, 13, 3, 14, 11,
+         19, 8, 21, 13, 18, 5, 17, 12, 19);
 
+## Test both subroutines..
 subtest 'fusc_seq' => sub {
-  is( join(' ',fusc_seq($_)), join ' ',@known[0..$_-1] ) foreach 0..@known-1;
+  is( join(' ',fusc_seq($_)), join ' ',@K[0..$_-1] ) foreach 0..@K-1;
+  done_testing();
+};
+
+subtest 'fusc_seq_cache' => sub {
+  is( join(' ',fusc_seq_cache($_)), join ' ',@K[0..$_-1] ) foreach reverse 0..@K-1;
   done_testing();
 };
 
 subtest 'fusc' => sub {
-  is( fusc($_),               $known[$_-1]             ) foreach 1..@known-1;
+  is( fusc($_),               $K[$_-1]             ) foreach 1..@K-1;
   done_testing();
 };
 
 done_testing();
+
+## Print the requested string....
 say join ' ',fusc_seq(50);
 
 sub fusc {
@@ -29,14 +42,25 @@ sub fusc {
 sub fusc_seq {
   my $n = shift;
   return 0..$n-1 if $n<2;
-  my @seq = (0,1,1); ## We need to use one more seed value as the 5th entry
-                     ## when we pushed it needs the 3rd one before it can
-                     ## push as we are pushing two at a time...
+  my @seq = (0,1,1); ## We need to use one more seed value as the 4th
+                     ## entry when we push it needs the 3rd one already
+                     ## defined as we are pushing two at a time...
 
-  ## We can simplify the code by pushing two entries onto the list each time...
+  ## We can simplify the code by pushing two entries onto the list each
+  ## time...
   push @seq, $seq[$_]+$seq[$_+1], $seq[$_+1] foreach 1..$n/2-1;
 
   ## and if odd we just remove the last one we added...
   pop @seq unless $n%2;
   return @seq;
 }
+
+## Added ac caching version - this time we remember the list using a
+## state variable - and use array slice operator to return the part
+## required (if cache bigger than requested chunk)
+sub fusc_seq_cache {
+  my $n = shift;
+  state  @seq = (0,1,1);
+  push   @seq, $seq[$_]+$seq[$_+1], $seq[$_+1] foreach @seq/2..$n/2-1;
+  return @seq[0..$n-1];
+}
-- 
cgit 


From 75df0fc1c419f52f82a385fdd2d81e78836a5a43 Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 15 Mar 2021 11:41:08 +0000
Subject: display list from each method!

---
 challenge-104/james-smith/perl/ch-1.pl | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/challenge-104/james-smith/perl/ch-1.pl b/challenge-104/james-smith/perl/ch-1.pl
index 1edbf506e4..9d8d2eb4cd 100644
--- a/challenge-104/james-smith/perl/ch-1.pl
+++ b/challenge-104/james-smith/perl/ch-1.pl
@@ -32,11 +32,13 @@ subtest 'fusc' => sub {
 done_testing();
 
 ## Print the requested string....
-say join ' ',fusc_seq(50);
+say join ' ',map { fusc($_) } 1..50;
+say join ' ',map { $_ } fusc_seq(50);
+say join ' ',fusc_seq_cache(50);
 
 sub fusc {
   my $n = shift;
-  (fusc_seq($n))[$n-1];
+  return $n ? (fusc_seq($n))[$n-1] : '';
 }
 
 sub fusc_seq {
-- 
cgit 


From dbb8361d66d9db35bcc45b88d77792b5f034c187 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 13:14:46 +0100
Subject: README for week 104

---
 challenge-104/abigail/README.md | 140 ++++++++--------------------------------
 1 file changed, 27 insertions(+), 113 deletions(-)

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index f8b761268c..3e6ba1fe6b 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -1,137 +1,51 @@
 # Solution by Abigail
-## [Chinese Zodiac](https://perlweeklychallenge.org/blog/perl-weekly-challenge-103/#TASK1)
+## [FUSC Sequence](https://perlweeklychallenge.org/blog/perl-weekly-challenge-104/#TASK1)
 
-You are given a year `$year`.
+Write a script to generate first 50 members of FUSC Sequence. Please
+refer to [OEIS](https://oeis.org/A002487) for more information._
 
-Write a script to determine the *Chinese Zodiac* for the given year
-$year. Please check out [wikipage](https://en.wikipedia.org/wiki/Chinese_zodiac)
-for more information about it.
+The sequence defined as below:
 
-The animal cycle:
-* Rat
-* Ox
-* Tiger
-* Rabbit
-* Dragon
-* Snake
-* Horse
-* Goat
-* Monkey
-* Rooster
-* Dog
-* Pig
-
-The element cycle:
-* Wood
-* Fire
-* Earth
-* Metal
-* Water
-
-### Examples
-#### Example 1
-~~~~
-Input: 2017
-Output: Fire Rooster
-~~~~
-
-#### Example 2
 ~~~~
-Input: 1938
-Output: Earth Tiger
+fusc(0) = 0
+fusc(1) = 1
+for n > 1:
+when n is even: fusc(n) = fusc(n / 2),
+when n is odd: fusc(n) = fusc((n-1)/2) + fusc((n+1)/2)
 ~~~~
 
 ### Notes
-We will actually output a three part string; beside the animal and element
-cycles, we also output the yin/yang cycle.
-
-We will be reading years from standard input, writing results to standard
-output.
+This challenge is beyond simple. Since we're asked to generate a
+fixed number of numbers, we don't need do any calculations, or
+even handle a single if statement. A single print statement is enough.
 
 ### Solutions
-* [AWK](awk/ch-1.awk)
-* [Bash](bash/ch-1.sh)
-* [Befunge-93](befunge-93/ch-1.bf93)
-* [C](c/ch-1.c)
-* [Lua](lua/ch-1.lua)
-* [Node.js](node/ch-1.js)
-* [Perl](perl/ch-1.pl)
-* [Python](python/ch-1.py)
-* [Ruby](ruby/ch-1.rb)
 
 ### Blog
-[Perl Weekly Challenge 103: Chinese Zodiac](https://wp.me/pcxd30-uS)
-
 
-## [What's playing?](https://perlweeklychallenge.org/blog/perl-weekly-challenge-103/#TASK2)
-Working from home, you decided that on occasion you wanted some
-background noise while working. You threw together a network streamer
-to continuously loop through the files and launched it in a tmux
-(or screen) session, giving it a directory tree of files to play.
-During the day, you connected an audio player to the stream, listening
-through the workday, closing it when done.
 
-For weeks you connect to the stream daily, slowly noticing a gradual
-drift of the media. After several weeks, you take vacation. When
-you return, you are pleasantly surprised to find the streamer still
-running. Before connecting, however, if you consider the puzzle of
-determining which track is playing.
+## [NIM Game](https://perlweeklychallenge.org/blog/perl-weekly-challenge-104/#TASK2)
+Write a script to simulate the NIM Game.
 
-After looking at a few modules to read info regarding the media, a
-quick bit of coding gave you a file list. The file list is in a
-simple CSV format, each line containing two fields: the first the
-number of milliseconds in length, the latter the media's title (this
-example is of several episodes available from the MercuryTheatre.info):
+It is played between 2 players. For the purpose of this task, let
+assume you play against the machine.
 
+There are 3 simple rules to follow:
 ~~~~
-1709363,"Les Miserables Episode 1: The Bishop (broadcast date: 1937-07-23)"
-1723781,"Les Miserables Episode 2: Javert (broadcast date: 1937-07-30)"
-1723781,"Les Miserables Episode 3: The Trial (broadcast date: 1937-08-06)"
-1678356,"Les Miserables Episode 4: Cosette (broadcast date: 1937-08-13)"
-1646043,"Les Miserables Episode 5: The Grave (broadcast date: 1937-08-20)"
-1714640,"Les Miserables Episode 6: The Barricade (broadcast date: 1937-08-27)"
-1714640,"Les Miserables Episode 7: Conclusion (broadcast date: 1937-09-03)"
+a) You have 12 tokens
+b) Each player can pick 1, 2 or 3 tokens at a time
+c) The player who picks the last token wins the game
 ~~~~
 
-For this script, you can assume to be provided the following information:
-* the value of `$^T` (`$BASETIME`) of the streamer script,
-* the value of `time()`, and
-* a CSV file containing the media to play consisting of the length in
-  milliseconds and an identifier for the media (title, filename, or other).
-
-Write a program to output which file is currently playing. For
-purposes of this script, you may assume gapless playback, and format
-the output as you see fit.
-
-Optional: Also display the current position in the media as a time-like value.
-
-### Example
-~~~~
-Input: 3 command line parameters: start time, current time, file name
-
-    # Streamer start time: Tue Nov 24 12:22:03 2020
-    1606134123
-
-    # Current time:        Mon Mar  1 09:34:36 2021
-    1614591276
-
-    # filelist.csv
-
-Output:
+### Notes
+This is *not* the NIM game. In the NIM game, you have multiple sets
+of tokens, and on each turn, a player picks a set, and removes any
+non-zero number of of tokens from the set. Typically, the player
+picking the last token loses.
 
-    "Les Miserables Episode 1: The Bishop (broadcast date: 1937-07-23)"
-    00:17:33
-~~~~
+The game as given is a win for the second player, who will win on
+the third move.
 
 ### Solutions
-* [GNU AWK](awk/ch-2.awk)
-* [Bash](bash/ch-2.sh)
-* [C](c/ch-2.c)
-* [Lua](lua/ch-2.lua)
-* [Node.js](node/ch-2.js)
-* [Perl](perl/ch-2.pl)
-* [Python](python/ch-2.py)
-* [Ruby](ruby/ch-2.rb)
 
 ### Blog
-[Perl Weekly Challenge 103: What's playing?](https://wp.me/pcxd30-v6)
-- 
cgit 


From e5112534f5dddae221cb17e4df99ab51800949bb Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 15 Mar 2021 08:21:10 -0400
Subject: 1st commit on 104_raku

---
 challenge-104/stuart-little/raku/ch-1.p6 | 14 ++++++++++++++
 challenge-104/stuart-little/raku/ch-2.p6 | 28 ++++++++++++++++++++++++++++
 2 files changed, 42 insertions(+)
 create mode 100755 challenge-104/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-104/stuart-little/raku/ch-2.p6

diff --git a/challenge-104/stuart-little/raku/ch-1.p6 b/challenge-104/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..3a09403f0b
--- /dev/null
+++ b/challenge-104/stuart-little/raku/ch-1.p6
@@ -0,0 +1,14 @@
+#!/usr/bin/env perl6
+use v6;
+
+# run <script> <nr elements to display; defaults to 50>
+
+sub fusc($n) {
+    my @a=(0,1);
+    for (2..$n-1) {
+	@a.push(($_ %% 2) ?? (@a[$_ div 2]) !! (@a[($_-1) div 2]+@a[($_+1) div 2]));
+    }
+    return @a;
+}
+
+for fusc((@*ARGS) ?? (@*ARGS[0].Int) !! (50)) {.say};
diff --git a/challenge-104/stuart-little/raku/ch-2.p6 b/challenge-104/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..24d2f64480
--- /dev/null
+++ b/challenge-104/stuart-little/raku/ch-2.p6
@@ -0,0 +1,28 @@
+#!/usr/bin/env perl6
+use v6;
+
+# run <script> <nr tokens; defaults to 12>
+
+sub youPlay($heap,$k){
+    $heap==0 && do {
+	say "You lose!";
+	exit;
+    }
+    say "The heap contains $heap tokens.";
+    my Int $take = prompt("How many tokens are you removing? Please enter an integer between 1 and $k inclusive: ");
+    compPlay($heap-$take,$k);
+}
+
+sub compPlay($heap,$k) {
+    $heap==0 && do {
+	say "You win!";
+	exit;
+    }
+    say "The heap contains $heap tokens.";
+    my Int $take = ($heap % ($k+1)) || (1..$k).roll;
+    say "The computer removes $take items.";
+    youPlay($heap-$take,$k)
+}
+
+my $heap = (@*ARGS) ?? (@*ARGS[0].Int) !! (12);
+youPlay($heap,3);
-- 
cgit 


From 67814aab0411ed46a4a33c7c0d8c0ef93e65f6fe Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 13:38:21 +0100
Subject: Tests for week 104, part 1

---
 challenge-104/abigail/t/ctest.ini      | 5 +++++
 challenge-104/abigail/t/input-1-1      | 0
 challenge-104/abigail/t/output-1-1.exp | 1 +
 3 files changed, 6 insertions(+)
 create mode 100644 challenge-104/abigail/t/ctest.ini
 create mode 100644 challenge-104/abigail/t/input-1-1
 create mode 100644 challenge-104/abigail/t/output-1-1.exp

diff --git a/challenge-104/abigail/t/ctest.ini b/challenge-104/abigail/t/ctest.ini
new file mode 100644
index 0000000000..18f469bf09
--- /dev/null
+++ b/challenge-104/abigail/t/ctest.ini
@@ -0,0 +1,5 @@
+[names]
+1-1 = Fixed output
+
+[1-1]
+no_input = 1
diff --git a/challenge-104/abigail/t/input-1-1 b/challenge-104/abigail/t/input-1-1
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/challenge-104/abigail/t/output-1-1.exp b/challenge-104/abigail/t/output-1-1.exp
new file mode 100644
index 0000000000..ddf8e134f9
--- /dev/null
+++ b/challenge-104/abigail/t/output-1-1.exp
@@ -0,0 +1 @@
+0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9
-- 
cgit 


From f0e5dc0b903fcd15e7b2e6901bc4fe8a6428933c Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 15 Mar 2021 09:27:10 -0400
Subject: 1st commit on 104_perl

---
 challenge-104/stuart-little/perl/ch-1.pl | 20 +++++++++++++++++++
 challenge-104/stuart-little/perl/ch-2.pl | 34 ++++++++++++++++++++++++++++++++
 2 files changed, 54 insertions(+)
 create mode 100755 challenge-104/stuart-little/perl/ch-1.pl
 create mode 100755 challenge-104/stuart-little/perl/ch-2.pl

diff --git a/challenge-104/stuart-little/perl/ch-1.pl b/challenge-104/stuart-little/perl/ch-1.pl
new file mode 100755
index 0000000000..0539e8ebda
--- /dev/null
+++ b/challenge-104/stuart-little/perl/ch-1.pl
@@ -0,0 +1,20 @@
+#!/usr/bin/perl
+use warnings;
+use v5.12;
+
+# run <script> <nr elements to display; defaults to 50>
+
+use feature qw(signatures);
+no warnings qw(experimental::signatures);
+
+sub fusc($n) {
+    my @a=(0,1);
+    for (2..$n-1) {
+	my $new = ($_ % 2 == 0) ? ($a[$_/2]) : ($a[($_-1)/2] + $a[($_+1)/2]);
+	push @a, ($new,);
+    }
+    return \@a;
+}
+
+my $nr = (scalar @ARGV) ? ($ARGV[0]) : (50);
+for (@{fusc($nr)}) {say};
diff --git a/challenge-104/stuart-little/perl/ch-2.pl b/challenge-104/stuart-little/perl/ch-2.pl
new file mode 100755
index 0000000000..26b7ab0428
--- /dev/null
+++ b/challenge-104/stuart-little/perl/ch-2.pl
@@ -0,0 +1,34 @@
+#!/usr/bin/perl
+use warnings;
+use v5.12;
+
+# run <script> <nr tokens; defaults to 12>
+
+use feature qw(signatures);
+no warnings qw(experimental::signatures);
+
+sub youPlay($heap,$k){
+    $heap==0 && do {
+	say "You lose!";
+	exit;
+    };
+    say "The heap contains $heap tokens.";
+    print "How many tokens are you removing? Please enter an integer between 1 and $k inclusive: ";
+    my $take = <STDIN>;
+    chomp($take);
+    compPlay($heap-$take,$k);
+}
+
+sub compPlay($heap,$k) {
+    $heap==0 && do {
+	say "You win!";
+	exit;
+    };
+    say "The heap contains $heap tokens.";
+    my $take = ($heap % ($k+1)) || [1..$k]->[rand $k];
+    say "The computer removes $take items.";
+    youPlay($heap-$take,$k);
+}
+
+my $heap = (scalar @ARGV) ? ($ARGV[0]) : (12);
+youPlay($heap,3);
-- 
cgit 


From 3d890e35ed395d83ad8d2529f55b8384ddcef7ae Mon Sep 17 00:00:00 2001
From: Roger Bell_West <roger@firedrake.org>
Date: Mon, 15 Mar 2021 13:34:42 +0000
Subject: Solutions for challenge #104

---
 challenge-104/roger-bell-west/perl/ch-1.pl   | 31 +++++++++++++++++++
 challenge-104/roger-bell-west/perl/ch-2.pl   | 38 +++++++++++++++++++++++
 challenge-104/roger-bell-west/python/ch-1.py | 33 ++++++++++++++++++++
 challenge-104/roger-bell-west/python/ch-2.py | 44 ++++++++++++++++++++++++++
 challenge-104/roger-bell-west/raku/ch-1.p6   | 31 +++++++++++++++++++
 challenge-104/roger-bell-west/raku/ch-2.p6   | 40 ++++++++++++++++++++++++
 challenge-104/roger-bell-west/ruby/ch-1.rb   | 35 +++++++++++++++++++++
 challenge-104/roger-bell-west/ruby/ch-2.rb   | 46 ++++++++++++++++++++++++++++
 challenge-104/roger-bell-west/rust/ch-1.rs   | 46 ++++++++++++++++++++++++++++
 challenge-104/roger-bell-west/rust/ch-2.rs   | 46 ++++++++++++++++++++++++++++
 10 files changed, 390 insertions(+)
 create mode 100755 challenge-104/roger-bell-west/perl/ch-1.pl
 create mode 100755 challenge-104/roger-bell-west/perl/ch-2.pl
 create mode 100755 challenge-104/roger-bell-west/python/ch-1.py
 create mode 100755 challenge-104/roger-bell-west/python/ch-2.py
 create mode 100755 challenge-104/roger-bell-west/raku/ch-1.p6
 create mode 100755 challenge-104/roger-bell-west/raku/ch-2.p6
 create mode 100755 challenge-104/roger-bell-west/ruby/ch-1.rb
 create mode 100755 challenge-104/roger-bell-west/ruby/ch-2.rb
 create mode 100755 challenge-104/roger-bell-west/rust/ch-1.rs
 create mode 100755 challenge-104/roger-bell-west/rust/ch-2.rs

diff --git a/challenge-104/roger-bell-west/perl/ch-1.pl b/challenge-104/roger-bell-west/perl/ch-1.pl
new file mode 100755
index 0000000000..5af118b4ab
--- /dev/null
+++ b/challenge-104/roger-bell-west/perl/ch-1.pl
@@ -0,0 +1,31 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use Test::More tests => 1;
+
+is_deeply(fuscseq(50),[0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9],'example 1');
+
+use Memoize;
+
+memoize('fusc');
+
+sub fusc {
+  my $n=shift;
+  if ($n==0) {
+    return 0;
+  } elsif ($n==1) {
+    return 1;
+  } elsif ($n%2 == 0) {
+    return fusc($n/2);
+  } else {
+    my $h=($n-1)/2;
+    return fusc($h)+fusc($h+1);
+  }
+}
+
+sub fuscseq {
+  my $m=shift;
+  return [map {fusc($_)} (0..$m-1)];
+}
diff --git a/challenge-104/roger-bell-west/perl/ch-2.pl b/challenge-104/roger-bell-west/perl/ch-2.pl
new file mode 100755
index 0000000000..436fb6bf41
--- /dev/null
+++ b/challenge-104/roger-bell-west/perl/ch-2.pl
@@ -0,0 +1,38 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use Test::More tests => 3;
+
+is(game(),1,'example 1');
+is(game(10),0,'example 2');
+is(game(14),0,'example 3');
+
+sub game {
+  my $heap=shift || 12;
+  my @players=qw(Alice Bob);
+  my $a=0;
+  while ($heap>0) {
+    my $n=play($heap);
+    $heap-=$n;
+    warn "$players[$a] takes $n leaving $heap.\n";
+    if ($heap==0) {
+      warn "$players[$a] wins.\n";
+      last;
+    }
+    $a++;
+    $a %= 2;
+  }
+  return $a;
+}
+
+sub play {
+  my $state=shift;
+  my $m=$state % 4;
+  if ($m==0) {
+    return int(rand()*3)+1;
+  } else {
+    return $m;
+  }
+}
diff --git a/challenge-104/roger-bell-west/python/ch-1.py b/challenge-104/roger-bell-west/python/ch-1.py
new file mode 100755
index 0000000000..7c63342d1f
--- /dev/null
+++ b/challenge-104/roger-bell-west/python/ch-1.py
@@ -0,0 +1,33 @@
+#! /usr/bin/python3
+
+def memoize(f):
+    memo = {}
+    def helper(x):
+        if x not in memo:            
+            memo[x] = f(x)
+        return memo[x]
+    return helper
+
+@memoize
+def fusc(n):
+    if n==0:
+        return 0
+    elif n==1:
+        return 1
+    elif n%2==0:
+        return fusc(n/2)
+    else:
+        h=(n-1)/2
+        return fusc(h)+fusc(h+1)
+
+def fuscseq(m):
+    return [fusc(i) for i in range(m)]
+
+import unittest
+
+class TestFusc(unittest.TestCase):
+
+        def test_ex1(self):
+            self.assertEqual(fuscseq(50),[0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9],'example 1')
+
+unittest.main()
diff --git a/challenge-104/roger-bell-west/python/ch-2.py b/challenge-104/roger-bell-west/python/ch-2.py
new file mode 100755
index 0000000000..58de50e398
--- /dev/null
+++ b/challenge-104/roger-bell-west/python/ch-2.py
@@ -0,0 +1,44 @@
+#! /usr/bin/python3
+
+import sys
+from random import randint
+
+def note(*a):
+    print(*a, file = sys.stderr)
+
+def game(hh=12):
+    heap=hh
+    players=["Alice","Bob"]
+    a=0
+    while heap>0:
+        n=play(heap)
+        heap -= n
+        note("{:s} takes {:d} leaving {:d}".format(players[a],n,heap))
+        if heap==0:
+            note("{:s} wins".format(players[a]))
+            break
+        a += 1
+        a %= 2
+    return a
+
+def play(state):
+    m=state % 4
+    if m==0:
+        return randint(1,3)
+    else:
+        return m
+
+import unittest
+
+class TestNim(unittest.TestCase):
+
+        def test_ex1(self):
+            self.assertEqual(game(),1,'example 1')
+                         
+        def test_ex2(self):
+            self.assertEqual(game(10),0,'example 2')
+                                          
+        def test_ex3(self):
+            self.assertEqual(game(14),0,'example 3')
+
+unittest.main()
diff --git a/challenge-104/roger-bell-west/raku/ch-1.p6 b/challenge-104/roger-bell-west/raku/ch-1.p6
new file mode 100755
index 0000000000..19191273e2
--- /dev/null
+++ b/challenge-104/roger-bell-west/raku/ch-1.p6
@@ -0,0 +1,31 @@
+#! /usr/bin/perl6
+
+use Test;
+
+plan 1;
+
+is-deeply(fuscseq(50),[0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9],'example 1');
+
+sub fusc($n) {
+  state %cache;
+  if (%cache{$n}:exists) {
+    return %cache{$n};
+  }
+  my $m;
+  if ($n==0) {
+    $m=0;
+  } elsif ($n==1) {
+    $m=1;
+  } elsif ($n%2 == 0) {
+    $m=fusc($n/2);
+  } else {
+    my $h=($n-1)/2;
+    $m=fusc($h)+fusc($h+1);
+  }
+  %cache{$n}=$m;
+  return $m;
+}
+
+sub fuscseq($m) {
+  return [map {fusc($_)},(0..$m-1)];
+}
diff --git a/challenge-104/roger-bell-west/raku/ch-2.p6 b/challenge-104/roger-bell-west/raku/ch-2.p6
new file mode 100755
index 0000000000..1a7791f685
--- /dev/null
+++ b/challenge-104/roger-bell-west/raku/ch-2.p6
@@ -0,0 +1,40 @@
+#! /usr/bin/perl6
+
+use Test;
+
+plan 3;
+
+is(game(),1,'example 1');
+is(game(10),0,'example 2');
+is(game(14),0,'example 3');
+
+multi game {
+  return game(12);
+}
+
+multi game($hh) {
+  my $heap=$hh;
+  my @players=('Alice','Bob');
+  my $a=0;
+  while ($heap>0) {
+    my $n=play($heap);
+    $heap-=$n;
+    note "@players[$a] takes $n leaving $heap.";
+    if ($heap==0) {
+      note "@players[$a] wins.";
+      last;
+    }
+    $a++;
+    $a %= 2;
+  }
+  return $a;
+}
+
+sub play($state) {
+  my $m=$state % 4;
+  if ($m==0) {
+    return floor(rand*3)+1;
+  } else {
+    return $m;
+  }
+}
diff --git a/challenge-104/roger-bell-west/ruby/ch-1.rb b/challenge-104/roger-bell-west/ruby/ch-1.rb
new file mode 100755
index 0000000000..1f6c4af355
--- /dev/null
+++ b/challenge-104/roger-bell-west/ruby/ch-1.rb
@@ -0,0 +1,35 @@
+#! /usr/bin/ruby
+
+$cache=Hash.new
+
+def fusc(n)
+  if $cache.has_key?(n) then
+    return $cache[n]
+  end
+  if n==0 then
+    m=0
+  elsif n==1 then
+    m=1
+  elsif n%2==0 then
+    m=fusc(n/2)
+  else
+    h=(n-1)/2
+    m=fusc(h)+fusc(h+1)
+  end
+  $cache[n]=m
+  return m
+end
+
+def fuscseq(m)
+    return 0.upto(m-1).map{|i| fusc(i)}
+end
+
+require 'test/unit'
+
+class TestFusc < Test::Unit::TestCase
+
+  def test_ex1
+    assert_equal([0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9],fuscseq(50))
+  end
+
+end
diff --git a/challenge-104/roger-bell-west/ruby/ch-2.rb b/challenge-104/roger-bell-west/ruby/ch-2.rb
new file mode 100755
index 0000000000..94fff0014f
--- /dev/null
+++ b/challenge-104/roger-bell-west/ruby/ch-2.rb
@@ -0,0 +1,46 @@
+#! /usr/bin/ruby
+
+def game(hh=12)
+  heap=hh
+  players=%w{ Alice Bob }
+  a=0
+  while heap>0
+    n=play(heap)
+    heap -= n
+    STDERR.puts("#{players[a]} takes #{n} leaving #{heap}")
+    if heap==0 then
+      STDERR.puts("#{players[a]} wins")
+      break
+    end
+    a += 1
+    a = a % 2
+  end
+  return a
+end
+
+def play(state)
+  m=state % 4
+  if m==0 then
+    return 1+rand(3)
+  else
+    return m
+  end
+end
+
+require 'test/unit'
+
+class TestNim < Test::Unit::TestCase
+
+  def test_ex1
+    assert_equal(game(),1)
+  end
+  
+  def test_ex2
+    assert_equal(game(10),0)
+  end
+  
+  def test_ex3
+    assert_equal(game(14),0)
+  end
+  
+end
diff --git a/challenge-104/roger-bell-west/rust/ch-1.rs b/challenge-104/roger-bell-west/rust/ch-1.rs
new file mode 100755
index 0000000000..59c6ec04e0
--- /dev/null
+++ b/challenge-104/roger-bell-west/rust/ch-1.rs
@@ -0,0 +1,46 @@
+#! /bin/sh
+//usr/bin/env rustc --test $0 -o ${0}x && ./${0}x; rm -f ${0}x ; exit
+
+use std::collections::HashMap;
+
+#[test]
+fn test_ex1() {
+    let mut fc=Fusc::new();
+    assert_eq!(fc.fuscseq(50),vec![0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9]);
+}
+
+pub struct Fusc {
+    cache: HashMap<u32,u32>
+}
+
+impl Fusc {
+
+    pub fn new() -> Fusc {
+        Fusc {
+            cache: HashMap::new()
+        }
+    }
+    
+    pub fn fuscseq(&mut self,m: u32) -> Vec<u32> {
+        return (0..m).map(|i| self.fusc(i)).collect::<Vec<u32>>();
+    }
+
+    pub fn fusc(&mut self,n: u32) -> u32 {
+        if self.cache.contains_key(&n) {
+            return *self.cache.get(&n).unwrap();
+        }
+        let m: u32;
+        if n==0 {
+            m=0;
+        } else if n==1 {
+            m=1;
+        } else if n%2 == 0 {
+            m=self.fusc(n/2)
+        } else {
+            let h: u32=(n-1)/2;
+            m=self.fusc(h)+self.fusc(h+1);
+        }
+        self.cache.insert(n,m);
+        return m;
+    }
+}
diff --git a/challenge-104/roger-bell-west/rust/ch-2.rs b/challenge-104/roger-bell-west/rust/ch-2.rs
new file mode 100755
index 0000000000..fc8861d4ea
--- /dev/null
+++ b/challenge-104/roger-bell-west/rust/ch-2.rs
@@ -0,0 +1,46 @@
+#! /bin/sh
+//usr/bin/env rustc --test $0 -o ${0}x && ./${0}x --nocapture; rm -f ${0}x ; exit
+
+use std::process;
+
+#[test]
+fn test_ex1() {
+    assert_eq!(game(12),1);
+}
+
+#[test]
+fn test_ex2() {
+    assert_eq!(game(10),0);
+}
+
+#[test]
+fn test_ex3() {
+    assert_eq!(game(14),0);
+}
+
+fn game (hh: u32) -> usize {
+    let mut heap: u32=hh;
+    let players=vec!["Alice","Bob"];
+    let mut a: usize=0;
+    while heap>0 {
+        let n=play(heap);
+        heap -= n;
+        eprintln!("{} takes {} leaving {}",players[a],n,heap);
+        if heap==0 {
+            eprintln!("{} wins",players[a]);
+            break;
+        }
+        a += 1;
+        a %= 2;
+    }
+    return a
+}
+
+fn play(state: u32) -> u32 {
+    let m=state % 4;
+    if m==0 {
+        return 1+(process::id()%3) as u32;
+    } else {
+        return m
+    }
+}
-- 
cgit 


From d5909a995faf964e3f730668facfca02bfcda251 Mon Sep 17 00:00:00 2001
From: Simon Proctor <simon.proctor@gmail.com>
Date: Mon, 15 Mar 2021 16:06:52 +0000
Subject: Nim Game

---
 challenge-104/simon-proctor/raku/ch-2.raku | 58 ++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 challenge-104/simon-proctor/raku/ch-2.raku

diff --git a/challenge-104/simon-proctor/raku/ch-2.raku b/challenge-104/simon-proctor/raku/ch-2.raku
new file mode 100644
index 0000000000..63dea34262
--- /dev/null
+++ b/challenge-104/simon-proctor/raku/ch-2.raku
@@ -0,0 +1,58 @@
+#!/usr/bin/env raku
+
+subset Difficulty of IntStr where 1 <= * <= 10;
+
+#| Play a Game of Nim
+sub MAIN(
+    Difficulty $iq = IntStr.new(5,"5"), #= The intelligence of the AI (1 is dumb, 10 is unbeatable)
+) {
+    
+    my $first;
+    while ( $first !~~ any(<y Y n N>) ) {
+	$first = prompt("Would you like to go first? [Y/n] ") || "y";
+    }
+    my $pieces = 12;
+
+    while ( $pieces > 0 ) {
+	say "$pieces {"#" x $pieces}";
+	given $first.uc {
+	    when "Y" {
+		my $how-many;
+		while ($how-many !~~ any(1,2,3)) {
+		    $how-many = prompt("How many would you like (1,2,3)? ");
+		}
+		$pieces -= $how-many;
+		$first = "N";
+	    }
+	    when "N" {
+		my $dumb = (1..10).pick;
+		my $choice = ai($iq.Int, $dumb, $pieces);
+		say "I take $choice";
+		$pieces -= $choice;
+		$first = "Y";
+	    }
+	}
+    }
+    given $first.uc {
+	when "Y" {
+	    say "I Won! Or course";
+	}
+	when "N" {
+	    say "Well done puny human";
+	}
+    }
+}
+
+multi sub ai($iqin, $dumb, $pieces) {
+    if ( $dumb > $iqin ) {
+	my $pick = (1..3).pick;
+	return $pieces < $pick ?? $pieces !! $pick;
+    } else {
+	given $pieces {
+	    when 12|8|4 { return 1 }
+	    when 11|7|3 { return 3 }
+	    when 10|6|2 { return 2 }
+	    when 9|5|1 { return 1 };
+	}
+    }
+}
-- 
cgit 


From a9aae705be67aefb5d89688b26be5a6d761883b3 Mon Sep 17 00:00:00 2001
From: Mark A <andemark@a-iot1t.uch.ad.pvt>
Date: Mon, 15 Mar 2021 10:39:42 -0600
Subject: ch-1.raku

---
 challenge-104/mark-anderson/raku/ch-1.raku | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 challenge-104/mark-anderson/raku/ch-1.raku

diff --git a/challenge-104/mark-anderson/raku/ch-1.raku b/challenge-104/mark-anderson/raku/ch-1.raku
new file mode 100644
index 0000000000..7da32b83a3
--- /dev/null
+++ b/challenge-104/mark-anderson/raku/ch-1.raku
@@ -0,0 +1,11 @@
+#!/usr/bin/env raku
+
+my @fusc = [0, 1];
+
+for 2..^50 -> $even, $odd 
+{
+    @fusc.push: @fusc[$even div 2];
+    @fusc.push: @fusc[$even div 2] + @fusc[($odd + 1) div 2];
+}
+
+say @fusc;
-- 
cgit 


From 2fc06782c4c4b468dd357bcce84f3e5aa90af5d2 Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 15 Mar 2021 18:19:53 +0000
Subject: added some nice recursive solutions for comparison

---
 challenge-104/james-smith/perl/ch-1.pl | 55 ++++++++++++++++++++++++++--------
 1 file changed, 43 insertions(+), 12 deletions(-)

diff --git a/challenge-104/james-smith/perl/ch-1.pl b/challenge-104/james-smith/perl/ch-1.pl
index 9d8d2eb4cd..69e1854c74 100644
--- a/challenge-104/james-smith/perl/ch-1.pl
+++ b/challenge-104/james-smith/perl/ch-1.pl
@@ -6,6 +6,16 @@ use warnings;
 use feature qw(say state);
 use Test::More;
 
+## This is the first 92 elements of the FUSC sequence for use
+## in testing...
+
+## We will write this in four ways....
+
+## As a recursive function to return each of the terms...
+## As a simple function which generate values into an array
+## For both methods we also add a cacheing version using
+## a state variable for the cache.
+
 my @K = (0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5,
          4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9,
          4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9, 7, 12,
@@ -13,7 +23,17 @@ my @K = (0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5,
          5, 14, 9, 13, 4, 15, 11, 18, 7, 17, 10, 13, 3, 14, 11,
          19, 8, 21, 13, 18, 5, 17, 12, 19);
 
-## Test both subroutines..
+subtest 'fusc' => sub {
+  is( fusc($_),               $K[$_]             ) foreach 0..@K-1;
+  done_testing();
+};
+
+subtest 'fusc_cache' => sub {
+  is( fusc($_),               $K[$_]             ) foreach 0..@K-1;
+  done_testing();
+};
+
+## Test all 3 subroutines..
 subtest 'fusc_seq' => sub {
   is( join(' ',fusc_seq($_)), join ' ',@K[0..$_-1] ) foreach 0..@K-1;
   done_testing();
@@ -24,23 +44,34 @@ subtest 'fusc_seq_cache' => sub {
   done_testing();
 };
 
-subtest 'fusc' => sub {
-  is( fusc($_),               $K[$_-1]             ) foreach 1..@K-1;
-  done_testing();
-};
-
 done_testing();
 
 ## Print the requested string....
-say join ' ',map { fusc($_) } 1..50;
-say join ' ',map { $_ } fusc_seq(50);
-say join ' ',fusc_seq_cache(50);
+say join ' ',map { fusc($_)          } 0..49;
+say join ' ',map { fusc_cache($_)    } 0..49;
+say join ' ',      fusc_seq(           50);
+say join ' ',      fusc_seq_cache(     50);
+
+## Recursive solution....
 
 sub fusc {
-  my $n = shift;
-  return $n ? (fusc_seq($n))[$n-1] : '';
+  my $n = int shift; ## We int here in case parameter passed in
+                     ## isn't an integer (and saves us "int"ing
+                     ## in the function calls themselves)
+                     ## Both look the floor $n/2 value, but when
+                     ## odd also looks at ceil $n/2.
+  return $n<2 ? $n : fusc($n/2) + ( $n%2 ? fusc($n/2+1) : 0 );
+}
+
+sub fusc_cache {     ## Same method but with cache
+  my $n = int shift;
+  state @cache;
+  return $cache[$n] ||= $n<2 ? $n :
+    fusc_cache($n/2) + ( $n%2 ? fusc_cache($n/2+1) : 0 );
 }
 
+## Sequence non recursive version!
+
 sub fusc_seq {
   my $n = shift;
   return 0..$n-1 if $n<2;
@@ -59,7 +90,7 @@ sub fusc_seq {
 
 ## Added ac caching version - this time we remember the list using a
 ## state variable - and use array slice operator to return the part
-## required (if cache bigger than requested chunk)
+## required (if cache bigger than requested sequence)
 sub fusc_seq_cache {
   my $n = shift;
   state  @seq = (0,1,1);
-- 
cgit 


From cf42a681de852f1ff3a9a5d0d245af3cfe0027d8 Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 15 Mar 2021 14:27:36 -0400
Subject: 1st commit on 104_haskell

---
 challenge-104/stuart-little/haskell/ch-1.hs | 16 +++++++++++++++
 challenge-104/stuart-little/haskell/ch-2.hs | 31 +++++++++++++++++++++++++++++
 2 files changed, 47 insertions(+)
 create mode 100755 challenge-104/stuart-little/haskell/ch-1.hs
 create mode 100755 challenge-104/stuart-little/haskell/ch-2.hs

diff --git a/challenge-104/stuart-little/haskell/ch-1.hs b/challenge-104/stuart-little/haskell/ch-1.hs
new file mode 100755
index 0000000000..8212259fdb
--- /dev/null
+++ b/challenge-104/stuart-little/haskell/ch-1.hs
@@ -0,0 +1,16 @@
+#!/usr/bin/env runghc
+
+-- run <script> <nr elements to display; defaults to 50>
+
+import Safe (headDef)
+import System.Environment (getArgs)
+
+memo_fusc :: Int -> Integer
+memo_fusc = (map fusc [0 ..] !!)
+   where fusc 0 = 0
+         fusc 1 = 1
+         fusc n = if (mod n 2 == 0) then (memo_fusc $ div n 2) else memo_fusc (div (n-1) 2) + memo_fusc (div (n+1) 2)
+
+main = do
+  nr <- getArgs >>= return . (read::String->Int) . headDef "50"
+  putStrLn $ unwords $ map show $ map memo_fusc [0..nr-1]
diff --git a/challenge-104/stuart-little/haskell/ch-2.hs b/challenge-104/stuart-little/haskell/ch-2.hs
new file mode 100755
index 0000000000..1a7d3e67b7
--- /dev/null
+++ b/challenge-104/stuart-little/haskell/ch-2.hs
@@ -0,0 +1,31 @@
+#!/usr/bin/env runghc
+
+-- run <script> <nr tokens; defaults to 12>
+
+import Safe (headDef)
+import System.Environment (getArgs)
+import System.Random (randomRIO)
+
+youPlay :: Int -> Int -> IO String
+youPlay hp k
+  |hp==0 = return "You lose!"
+  |otherwise = do
+     putStrLn $ "The heap contains " ++ (show hp) ++ " tokens."
+     putStrLn $ "How many tokens are you removing? Please enter an integer between 1 and " ++ (show k) ++ " inclusive: "
+     take <- getLine >>= return . (read::String->Int)
+     compPlay (hp-take) k
+
+compPlay :: Int -> Int -> IO String
+compPlay hp k
+  |hp==0 = return "You win!"
+  |otherwise = do
+     putStrLn $ "The heap contains " ++ (show hp) ++ " tokens."
+     rnd <- randomRIO (1,k)
+     let take = if (mod hp (k+1) /= 0) then (mod hp (k+1)) else rnd
+     putStrLn $ "The computer removes " ++ (show take) ++ " items."
+     youPlay (hp-take) k
+
+main = do
+  hp <- getArgs >>= return . (read::String->Int) . headDef "12"
+  out <- youPlay hp 3
+  putStrLn out
-- 
cgit 


From 17819b37061916eb8e8d5cafee65df39cd82980a Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 14:18:10 +0100
Subject: Perl solution for week 104, part 1

---
 challenge-104/abigail/README.md    |  1 +
 challenge-104/abigail/perl/ch-1.pl | 41 ++++++++++++++++++++++++++++++++++++++
 2 files changed, 42 insertions(+)
 create mode 100644 challenge-104/abigail/perl/ch-1.pl

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 3e6ba1fe6b..ca4e11b737 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -20,6 +20,7 @@ fixed number of numbers, we don't need do any calculations, or
 even handle a single if statement. A single print statement is enough.
 
 ### Solutions
+* [Perl](perl/ch-1.pl)
 
 ### Blog
 
diff --git a/challenge-104/abigail/perl/ch-1.pl b/challenge-104/abigail/perl/ch-1.pl
new file mode 100644
index 0000000000..a8c9fe1d29
--- /dev/null
+++ b/challenge-104/abigail/perl/ch-1.pl
@@ -0,0 +1,41 @@
+#!/opt/perl/bin/perl
+
+use 5.032;
+
+use strict;
+use warnings;
+no  warnings 'syntax';
+
+use experimental 'signatures';
+use experimental 'lexical_subs';
+
+#
+# See ../README.md
+#
+
+#
+# Run as: perl ch-1.pl
+#
+
+#
+# This challenge is beyond simple. We're asked to output a fixed list
+# of 50 numbers. We're not getting any input, so each run of the program
+# is going to produce the same output.
+#
+# Now, if we were to be asked to produce the Nth number of the fucs
+# sequence, or the first N numbers, we might have written some like
+#
+# sub f ($n) {
+#    state $c = {0 => 0, 1 => 1};
+#    $$c {$n} //= $n % 2 ? f (($n - 1) / 2) + f (($n + 1) / 2) : f ($n / 2)}
+#
+# But since we're not asked to do anything smart, we just fetch the
+# first 50 numbers from the link provided and print them.
+#
+# After all, the first rule of optimization is: don't calculate anything
+# you don't have to calculate.
+#
+
+
+say "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " .
+    "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9";
-- 
cgit 


From e149d24da503c8ffef7c4d9eb78ef69546d35196 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 14:27:47 +0100
Subject: AWK, Bash and C solution for week 104, part 1

---
 challenge-104/abigail/README.md    |  3 +++
 challenge-104/abigail/awk/ch-1.awk | 14 ++++++++++++++
 challenge-104/abigail/bash/ch-1.sh | 12 ++++++++++++
 challenge-104/abigail/c/ch-1.c     | 18 ++++++++++++++++++
 4 files changed, 47 insertions(+)
 create mode 100644 challenge-104/abigail/awk/ch-1.awk
 create mode 100644 challenge-104/abigail/bash/ch-1.sh
 create mode 100644 challenge-104/abigail/c/ch-1.c

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index ca4e11b737..18c1827e9b 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -20,6 +20,9 @@ fixed number of numbers, we don't need do any calculations, or
 even handle a single if statement. A single print statement is enough.
 
 ### Solutions
+* [AWK](awk/ch-1.awk)
+* [Bash](bash/ch-1.sh)
+* [C](c/ch-1.c)
 * [Perl](perl/ch-1.pl)
 
 ### Blog
diff --git a/challenge-104/abigail/awk/ch-1.awk b/challenge-104/abigail/awk/ch-1.awk
new file mode 100644
index 0000000000..cf5aff62fd
--- /dev/null
+++ b/challenge-104/abigail/awk/ch-1.awk
@@ -0,0 +1,14 @@
+#!/usr/bin/awk
+
+#
+# See ../README.md
+#
+
+#
+# Run as: awk -f ch-1.awk
+#
+
+BEGIN {
+    print "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " \
+          "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9"
+}
diff --git a/challenge-104/abigail/bash/ch-1.sh b/challenge-104/abigail/bash/ch-1.sh
new file mode 100644
index 0000000000..8dde31977a
--- /dev/null
+++ b/challenge-104/abigail/bash/ch-1.sh
@@ -0,0 +1,12 @@
+#!/bin/sh
+
+#
+# See ../README.md
+#
+
+#
+# Run as: bash ch-1.sh
+#
+
+echo "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 "\
+"5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9"
diff --git a/challenge-104/abigail/c/ch-1.c b/challenge-104/abigail/c/ch-1.c
new file mode 100644
index 0000000000..8383b80d70
--- /dev/null
+++ b/challenge-104/abigail/c/ch-1.c
@@ -0,0 +1,18 @@
+# include <stdlib.h>
+# include <stdio.h>
+# include <string.h>
+
+/*
+ * See ../README.md
+ */
+
+/*
+ * Run as: cc -o ch-1.o ch-1.c; ./ch-1.o
+ */
+
+int main (void) {
+    printf ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 "
+            "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9\n");
+
+    return (0);
+}
-- 
cgit 


From e18a3b4909665a6d9b0db5f0217e0b626ef9cb89 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 14:37:32 +0100
Subject: Lua, Node.js, Python and Ruby solutions for week 104, part 1

---
 challenge-104/abigail/README.md      |  5 +++++
 challenge-104/abigail/lua/ch-1.lua   | 12 ++++++++++++
 challenge-104/abigail/node/ch-1.js   | 12 ++++++++++++
 challenge-104/abigail/python/ch-1.py | 12 ++++++++++++
 challenge-104/abigail/ruby/ch-1.rb   | 12 ++++++++++++
 5 files changed, 53 insertions(+)
 create mode 100644 challenge-104/abigail/lua/ch-1.lua
 create mode 100644 challenge-104/abigail/node/ch-1.js
 create mode 100644 challenge-104/abigail/python/ch-1.py
 create mode 100644 challenge-104/abigail/ruby/ch-1.rb

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 18c1827e9b..9d43c0de75 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -22,8 +22,13 @@ even handle a single if statement. A single print statement is enough.
 ### Solutions
 * [AWK](awk/ch-1.awk)
 * [Bash](bash/ch-1.sh)
+* [Befunge-93](befunge-93/ch-1.bf93)
 * [C](c/ch-1.c)
+* [Lua](lua/ch-1.lua)
+* [Node.js](node/ch-1.js)
 * [Perl](perl/ch-1.pl)
+* [Python](python/ch-1.py)
+* [Ruby](ruby/ch-1.rb)
 
 ### Blog
 
diff --git a/challenge-104/abigail/lua/ch-1.lua b/challenge-104/abigail/lua/ch-1.lua
new file mode 100644
index 0000000000..52af3c7d45
--- /dev/null
+++ b/challenge-104/abigail/lua/ch-1.lua
@@ -0,0 +1,12 @@
+#!/opt/local/bin/lua
+
+--
+-- See ../README.md
+--
+
+--
+-- Run as: lua ch-1.lua
+--
+
+print ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " ..
+       "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9")
diff --git a/challenge-104/abigail/node/ch-1.js b/challenge-104/abigail/node/ch-1.js
new file mode 100644
index 0000000000..bd0e037eef
--- /dev/null
+++ b/challenge-104/abigail/node/ch-1.js
@@ -0,0 +1,12 @@
+#!/usr/local/bin/node
+
+//
+// See ../README.md
+//
+
+//
+// Run as: node ch-1.js
+//
+
+console . log ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " +
+               "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9")
diff --git a/challenge-104/abigail/python/ch-1.py b/challenge-104/abigail/python/ch-1.py
new file mode 100644
index 0000000000..8a7dac03e9
--- /dev/null
+++ b/challenge-104/abigail/python/ch-1.py
@@ -0,0 +1,12 @@
+#!/opt/local/bin/python
+
+#
+# See ../README.md
+#
+
+#
+# Run as python ch-1.py
+#
+
+print ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " +
+       "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9")
diff --git a/challenge-104/abigail/ruby/ch-1.rb b/challenge-104/abigail/ruby/ch-1.rb
new file mode 100644
index 0000000000..96d68064e5
--- /dev/null
+++ b/challenge-104/abigail/ruby/ch-1.rb
@@ -0,0 +1,12 @@
+#!/usr/bin/ruby
+
+#
+# See ../README.md
+#
+ 
+#
+# Run as: ruby ch-1.rb
+#
+
+puts ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 " +
+      "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9")
-- 
cgit 


From ee379c0e8d6d4da5ab272350cba98afb20c208e3 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 14:44:40 +0100
Subject: BASIC solution for week 104, part 1

---
 challenge-104/abigail/README.md      |  1 +
 challenge-104/abigail/basic/ch-1.bas | 11 +++++++++++
 2 files changed, 12 insertions(+)
 create mode 100644 challenge-104/abigail/basic/ch-1.bas

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 9d43c0de75..56719690f7 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -22,6 +22,7 @@ even handle a single if statement. A single print statement is enough.
 ### Solutions
 * [AWK](awk/ch-1.awk)
 * [Bash](bash/ch-1.sh)
+* [Basic](basic/ch-1.bas)
 * [Befunge-93](befunge-93/ch-1.bf93)
 * [C](c/ch-1.c)
 * [Lua](lua/ch-1.lua)
diff --git a/challenge-104/abigail/basic/ch-1.bas b/challenge-104/abigail/basic/ch-1.bas
new file mode 100644
index 0000000000..8e5ab98e23
--- /dev/null
+++ b/challenge-104/abigail/basic/ch-1.bas
@@ -0,0 +1,11 @@
+010 REM 
+020 REM See ../README.md
+030 REM 
+
+040 REM 
+050 REM Run as: basic ch-1.bas
+060 REM 
+
+
+100 PRINT "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 ";
+200 PRINT "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9"
-- 
cgit 


From 2c25799f474f9ee527ad021cc0f13a2ef91234ce Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 14:58:24 +0100
Subject: bc solution for week 104, part 2

---
 challenge-104/abigail/README.md  | 1 +
 challenge-104/abigail/bc/ch-1.bc | 8 ++++++++
 2 files changed, 9 insertions(+)
 create mode 100644 challenge-104/abigail/bc/ch-1.bc

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 56719690f7..17bcb41f68 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -24,6 +24,7 @@ even handle a single if statement. A single print statement is enough.
 * [Bash](bash/ch-1.sh)
 * [Basic](basic/ch-1.bas)
 * [Befunge-93](befunge-93/ch-1.bf93)
+* [bc](bc/ch-1.bc)
 * [C](c/ch-1.c)
 * [Lua](lua/ch-1.lua)
 * [Node.js](node/ch-1.js)
diff --git a/challenge-104/abigail/bc/ch-1.bc b/challenge-104/abigail/bc/ch-1.bc
new file mode 100644
index 0000000000..a01629f2fe
--- /dev/null
+++ b/challenge-104/abigail/bc/ch-1.bc
@@ -0,0 +1,8 @@
+#
+# Run as: bc ch-1.bc
+#
+"0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 "
+"5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9"
+"
+"
+quit
-- 
cgit 


From 4683307c03fd8a99c0cb6ae7400db498f10a9dfe Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 15:15:49 +0100
Subject: Fortran solution for week 104, part 1

---
 challenge-104/abigail/README.md        |  1 +
 challenge-104/abigail/fortran/ch-1.f90 | 14 ++++++++++++++
 2 files changed, 15 insertions(+)
 create mode 100644 challenge-104/abigail/fortran/ch-1.f90

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 17bcb41f68..bb367b0619 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -26,6 +26,7 @@ even handle a single if statement. A single print statement is enough.
 * [Befunge-93](befunge-93/ch-1.bf93)
 * [bc](bc/ch-1.bc)
 * [C](c/ch-1.c)
+* [Fortran](fortran/ch-1.f90)
 * [Lua](lua/ch-1.lua)
 * [Node.js](node/ch-1.js)
 * [Perl](perl/ch-1.pl)
diff --git a/challenge-104/abigail/fortran/ch-1.f90 b/challenge-104/abigail/fortran/ch-1.f90
new file mode 100644
index 0000000000..07ddd3f569
--- /dev/null
+++ b/challenge-104/abigail/fortran/ch-1.f90
@@ -0,0 +1,14 @@
+!
+! See ../README.md
+!
+
+!
+! Run as: gfortran -o ch-1.o ch-1.f90; ./ch-1.o
+!
+
+program fucs
+    implicit none
+    write(*,fmt="(A)", advance='no')  "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 "
+    write(*,fmt="(A)", advance='no')  "4 7 3 8 5 7 2 7 5 8 3 7 4 5 1 6 5 9 "
+    write(*,fmt="(A)", advance='yes') "4 11 7 10 3 11 8 13 5 12 7 9 2 9"
+end
-- 
cgit 


From 61d799647cf15dcc4d83a8e2260134f007f0c5bb Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 15:49:40 +0100
Subject: Forth solution for week 104, part 1

---
 challenge-104/abigail/README.md     | 1 +
 challenge-104/abigail/forth/ch-1.fs | 7 +++++++
 2 files changed, 8 insertions(+)
 create mode 100644 challenge-104/abigail/forth/ch-1.fs

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index bb367b0619..753280fd97 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -26,6 +26,7 @@ even handle a single if statement. A single print statement is enough.
 * [Befunge-93](befunge-93/ch-1.bf93)
 * [bc](bc/ch-1.bc)
 * [C](c/ch-1.c)
+* [Forth](forth/ch-1.fs)
 * [Fortran](fortran/ch-1.f90)
 * [Lua](lua/ch-1.lua)
 * [Node.js](node/ch-1.js)
diff --git a/challenge-104/abigail/forth/ch-1.fs b/challenge-104/abigail/forth/ch-1.fs
new file mode 100644
index 0000000000..f508acae54
--- /dev/null
+++ b/challenge-104/abigail/forth/ch-1.fs
@@ -0,0 +1,7 @@
+\
+\ See ../README.md
+\
+
+.( 0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 )
+.( 5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9)
+CR
-- 
cgit 


From 8b3d81c89bc889c66d6ff014a777020ee6c44d39 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 16:51:30 +0100
Subject: Befunge-93 solution for week 104, part 1

---
 challenge-104/abigail/befunge-93/ch-1.bf93 | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 challenge-104/abigail/befunge-93/ch-1.bf93

diff --git a/challenge-104/abigail/befunge-93/ch-1.bf93 b/challenge-104/abigail/befunge-93/ch-1.bf93
new file mode 100644
index 0000000000..c923c54175
--- /dev/null
+++ b/challenge-104/abigail/befunge-93/ch-1.bf93
@@ -0,0 +1,5 @@
+v#<v"0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 "
+< ^ "5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9" +55
+ > v
+   :
+ ^,_@
-- 
cgit 


From a25700559b1eec24b8b2060d2b7c1c42b98cc6f8 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 16:52:19 +0100
Subject: Cobol solution for week 104, part 1

---
 challenge-104/abigail/README.md     |  1 +
 challenge-104/abigail/cobol/ch-1.cb | 12 ++++++++++++
 2 files changed, 13 insertions(+)
 create mode 100644 challenge-104/abigail/cobol/ch-1.cb

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index 753280fd97..cd806d9580 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -26,6 +26,7 @@ even handle a single if statement. A single print statement is enough.
 * [Befunge-93](befunge-93/ch-1.bf93)
 * [bc](bc/ch-1.bc)
 * [C](c/ch-1.c)
+* [Cobol](cobol/ch-1.cb)
 * [Forth](forth/ch-1.fs)
 * [Fortran](fortran/ch-1.f90)
 * [Lua](lua/ch-1.lua)
diff --git a/challenge-104/abigail/cobol/ch-1.cb b/challenge-104/abigail/cobol/ch-1.cb
new file mode 100644
index 0000000000..91cdc1874c
--- /dev/null
+++ b/challenge-104/abigail/cobol/ch-1.cb
@@ -0,0 +1,12 @@
+       IDENTIFICATION DIVISION.
+       PROGRAM-ID. FUCS.
+
+      *
+      * See README.md
+      *
+
+       PROCEDURE DIVISION.
+           DISPLAY "0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 " WITH NO ADVANCING.
+           DISPLAY "5 4 7 3 8 5 7 2 7 5 8 3 7 4 5 1 6 " WITH NO ADVANCING.
+           DISPLAY "5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9".
+           STOP RUN.
-- 
cgit 


From ce73b149923a3f69f2af1dfe4d210f64c67a2acd Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 17:10:38 +0100
Subject: Go solution for week 104, part 1

---
 challenge-104/abigail/README.md  |  1 +
 challenge-104/abigail/go/ch-1.go | 16 ++++++++++++++++
 2 files changed, 17 insertions(+)
 create mode 100644 challenge-104/abigail/go/ch-1.go

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index cd806d9580..be78ee76e2 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -29,6 +29,7 @@ even handle a single if statement. A single print statement is enough.
 * [Cobol](cobol/ch-1.cb)
 * [Forth](forth/ch-1.fs)
 * [Fortran](fortran/ch-1.f90)
+* [Go](go/ch-1.go)
 * [Lua](lua/ch-1.lua)
 * [Node.js](node/ch-1.js)
 * [Perl](perl/ch-1.pl)
diff --git a/challenge-104/abigail/go/ch-1.go b/challenge-104/abigail/go/ch-1.go
new file mode 100644
index 0000000000..ef5d6fb291
--- /dev/null
+++ b/challenge-104/abigail/go/ch-1.go
@@ -0,0 +1,16 @@
+package main
+
+//
+// See ../README.md
+//
+
+//
+// Run as: go run ch-1.go
+//
+
+import "fmt"
+
+func main () {
+    fmt . Print ("0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 ")
+    fmt . Print ("5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9\n")
+}
-- 
cgit 


From d4c8dac6653cf637f7f3791d2e2f358af9bf0671 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 17:51:54 +0100
Subject: Pascal solution for week 104, part 1

---
 challenge-104/abigail/README.md     |  2 ++
 challenge-104/abigail/pascal/ch-1.p | 10 ++++++++++
 2 files changed, 12 insertions(+)
 create mode 100644 challenge-104/abigail/pascal/ch-1.p

diff --git a/challenge-104/abigail/README.md b/challenge-104/abigail/README.md
index be78ee76e2..674f53ee11 100644
--- a/challenge-104/abigail/README.md
+++ b/challenge-104/abigail/README.md
@@ -32,9 +32,11 @@ even handle a single if statement. A single print statement is enough.
 * [Go](go/ch-1.go)
 * [Lua](lua/ch-1.lua)
 * [Node.js](node/ch-1.js)
+* [Pascal](perl/ch-1.p)
 * [Perl](perl/ch-1.pl)
 * [Python](python/ch-1.py)
 * [Ruby](ruby/ch-1.rb)
+* [SQL](sql/ch-1.sql)
 
 ### Blog
 
diff --git a/challenge-104/abigail/pascal/ch-1.p b/challenge-104/abigail/pascal/ch-1.p
new file mode 100644
index 0000000000..1ee40f4f42
--- /dev/null
+++ b/challenge-104/abigail/pascal/ch-1.p
@@ -0,0 +1,10 @@
+Program FUCS;
+
+(*                  *)
+(* See ../README.md *)
+(*                  *)
+
+begin
+    write   ('0 1 1 2 1 3 2 3 1 4 3 5 2 5 3 4 1 5 4 7 3 8 5 7 2 7 ');
+    writeln ('5 8 3 7 4 5 1 6 5 9 4 11 7 10 3 11 8 13 5 12 7 9 2 9');
+end.
-- 
cgit 


From 3cdcee087aee807f269bfd8765fab79f214a7f58 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 15 Mar 2021 19:37:26 +0100
Subject: Test cases for week 104, part 2

---
 challenge-104/abigail/t/ctest.ini       | 27 +++++++++++++++++++++++++++
 challenge-104/abigail/t/input-2-1       |  3 +++
 challenge-104/abigail/t/input-2-10      |  3 +++
 challenge-104/abigail/t/input-2-11      |  3 +++
 challenge-104/abigail/t/input-2-12      |  3 +++
 challenge-104/abigail/t/input-2-13      |  3 +++
 challenge-104/abigail/t/input-2-14      |  3 +++
 challenge-104/abigail/t/input-2-15      |  3 +++
 challenge-104/abigail/t/input-2-16      |  3 +++
 challenge-104/abigail/t/input-2-17      |  3 +++
 challenge-104/abigail/t/input-2-18      |  3 +++
 challenge-104/abigail/t/input-2-19      |  3 +++
 challenge-104/abigail/t/input-2-2       |  3 +++
 challenge-104/abigail/t/input-2-20      |  3 +++
 challenge-104/abigail/t/input-2-21      |  3 +++
 challenge-104/abigail/t/input-2-22      |  3 +++
 challenge-104/abigail/t/input-2-23      |  3 +++
 challenge-104/abigail/t/input-2-24      |  3 +++
 challenge-104/abigail/t/input-2-25      |  3 +++
 challenge-104/abigail/t/input-2-26      |  3 +++
 challenge-104/abigail/t/input-2-27      |  3 +++
 challenge-104/abigail/t/input-2-3       |  3 +++
 challenge-104/abigail/t/input-2-4       |  3 +++
 challenge-104/abigail/t/input-2-5       |  3 +++
 challenge-104/abigail/t/input-2-6       |  3 +++
 challenge-104/abigail/t/input-2-7       |  3 +++
 challenge-104/abigail/t/input-2-8       |  3 +++
 challenge-104/abigail/t/input-2-9       |  3 +++
 challenge-104/abigail/t/output-2-1.exp  |  4 ++++
 challenge-104/abigail/t/output-2-10.exp |  4 ++++
 challenge-104/abigail/t/output-2-11.exp |  4 ++++
 challenge-104/abigail/t/output-2-12.exp |  4 ++++
 challenge-104/abigail/t/output-2-13.exp |  4 ++++
 challenge-104/abigail/t/output-2-14.exp |  4 ++++
 challenge-104/abigail/t/output-2-15.exp |  4 ++++
 challenge-104/abigail/t/output-2-16.exp |  4 ++++
 challenge-104/abigail/t/output-2-17.exp |  4 ++++
 challe