From 16bc0dcb20a36d06296ef7de89c6c0f3a4da25dd Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Aug 2021 10:09:27 +0100
Subject: challenge 1 arbitrary size!

---
 challenge-124/james-smith/perl/ch-1.pl | 52 ++++++++++++++++++++++++++++++++++
 challenge-124/james-smith/perl/ch-2.pl | 22 ++++++++++++++
 2 files changed, 74 insertions(+)
 create mode 100644 challenge-124/james-smith/perl/ch-1.pl
 create mode 100644 challenge-124/james-smith/perl/ch-2.pl

diff --git a/challenge-124/james-smith/perl/ch-1.pl b/challenge-124/james-smith/perl/ch-1.pl
new file mode 100644
index 0000000000..98695a06ea
--- /dev/null
+++ b/challenge-124/james-smith/perl/ch-1.pl
@@ -0,0 +1,52 @@
+#!/usr/local/bin/perl
+
+use strict;
+
+use warnings;
+use feature qw(say);
+use Test::More;
+use Benchmark qw(cmpthese timethis);
+use Data::Dumper qw(Dumper);
+my $tau = 6.283185307179586476925286766559;
+
+
+my $radius = @ARGV ? shift @ARGV : 10;
+my $cross  = @ARGV ? shift @ARGV : $radius;
+   $cross++ if $cross&1;
+
+### A simple one to render the cross as drawin the question...
+
+unless($radius) {
+  my @pts = qw(-1 3 4 5 5 5 5 5 4 3 -1 0 0 0 -1 0 0);
+  say $_ < 0 ? '    ^^^^^'
+    : !$_    ? '      ^'
+    : ' ' x (6-$_) . '^' . ' 'x($_*2-1) .'^'
+    foreach @pts;
+  exit;
+}
+
+## We will render the relevant sized venus symbol...
+
+## Create the canvas..
+my @a = map { ' ' x ($radius*2+1) } 0..$radius*2+$cross;
+
+## Now we draw the circle...
+foreach my $x (0..$radius) {
+  my $y = int sqrt( $radius**2 - $x**2 );
+  substr $a[ $radius - $x ],$radius-$y,1,'^';
+  substr $a[ $radius + $x ],$radius-$y,1,'^';
+  substr $a[ $radius - $x ],$radius+$y,1,'^';
+  substr $a[ $radius + $x ],$radius+$y,1,'^';
+  substr $a[ $radius - $y ],$radius-$x,1,'^';
+  substr $a[ $radius + $y ],$radius-$x,1,'^';
+  substr $a[ $radius - $y ],$radius+$x,1,'^';
+  substr $a[ $radius + $y ],$radius+$x,1,'^';
+}
+
+## And the two parts of the cross...
+substr $a[2*$radius+$_],$radius,1,'^' foreach 0..$cross;
+substr $a[2*$radius+$cross/2],$radius-$cross/2,$cross+1,'^'x($cross+1);
+
+### Finally we render the canvas...
+say $_ foreach @a;
+
diff --git a/challenge-124/james-smith/perl/ch-2.pl b/challenge-124/james-smith/perl/ch-2.pl
new file mode 100644
index 0000000000..2348c8b946
--- /dev/null
+++ b/challenge-124/james-smith/perl/ch-2.pl
@@ -0,0 +1,22 @@
+#!/usr/local/bin/perl
+
+use strict;
+
+use warnings;
+use feature qw(say);
+use Test::More;
+use Benchmark qw(cmpthese timethis);
+use Data::Dumper qw(Dumper);
+
+my @TESTS = (
+  [ 0, 1 ],
+);
+
+is( my_function($_->[0]), $_->[1] ) foreach @TESTS;
+
+done_testing();
+
+sub my_function {
+  return 1;
+}
+
-- 
cgit 


From 104dd682d296f7ab6aedafd35a2d86f16a7a79b5 Mon Sep 17 00:00:00 2001
From: Mark A <andemark@a-iot1t.uch.ad.pvt>
Date: Mon, 2 Aug 2021 03:16:14 -0600
Subject: ch-2.raku

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

diff --git a/challenge-124/mark-anderson/raku/ch-2.raku b/challenge-124/mark-anderson/raku/ch-2.raku
new file mode 100644
index 0000000000..6762d2c45e
--- /dev/null
+++ b/challenge-124/mark-anderson/raku/ch-2.raku
@@ -0,0 +1,18 @@
+#!/usr/bin/env raku
+
+say tug-of-war(10, 20 ... 100);
+say tug-of-war(10, -15, 20, 30, -25, 0, 5, 40, -5);
+
+sub tug-of-war(+$list)
+{
+    my $n = $list.elems div 2;
+
+    my %h = $list.combinations($n).map(-> @a
+    {
+        my @b = ($list (-) @a).keys;
+
+        abs(@b.sum - @a.sum) => @a ~ ' ' ~ @b;
+    });
+
+    .head($n), .tail(* - $n) with %h.min.value.split(/\s/).cache;
+}
-- 
cgit 


From c1646be90db79f876b0bafed002c3976333ee540 Mon Sep 17 00:00:00 2001
From: Scimon Proctor <simon.proctor@gmail.com>
Date: Mon, 2 Aug 2021 10:35:01 +0100
Subject: Challege 1 (with variable sizing)

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

diff --git a/challenge-124/simon-proctor/raku/ch-1.raku b/challenge-124/simon-proctor/raku/ch-1.raku
new file mode 100644
index 0000000000..da4022e6b9
--- /dev/null
+++ b/challenge-124/simon-proctor/raku/ch-1.raku
@@ -0,0 +1,47 @@
+#!/usr/bin/env raku
+
+constant SYM = '♀';
+
+multi sub MAIN( 1 ) is hidden-from-USAGE { say SYM }
+
+#| Given a radius for the circle draw the Female Symbol
+multi sub MAIN(
+    UInt $rad where * <= 20 #= Radius from 1 to 20
+) {
+    draw-circle( $rad );
+    draw-cross( $rad );
+}
+
+sub draw-circle( \rad ) {
+    # Totally nicked this from here : https://stackoverflow.com/questions/1022178/how-to-make-a-circle-on-a-grid
+    my \grid-size = (rad * 2)+1;
+    my @grid = [ [ " " xx grid-size ] xx grid-size ];
+    my Int $x = 0;
+    my Int $y = rad;
+    my Int $d = 3 - (2 * rad);
+    my \c = rad;
+    repeat {
+        @grid[c+$y][c+$x] = SYM;
+        @grid[c-$y][c+$x] = SYM;
+        @grid[c-$y][c-$x] = SYM;
+        @grid[c+$y][c-$x] = SYM;
+        @grid[c+$x][c+$y] = SYM;
+        @grid[c-$x][c+$y] = SYM;
+        @grid[c-$x][c-$y] = SYM;
+        @grid[c+$x][c-$y] = SYM;
+        if ( $d < 0 ) {
+            $d = $d + (4 * $x) + 6
+        } else {
+            $d = $d + 4 * ( $x - $y) + 10;
+            $y--;
+        }
+        $x++;
+    } while ($x <= $y);
+    .say for @grid.map( *.join("") );
+}
+
+sub draw-cross( \rad ) {
+    (" " x rad ~ SYM).say for 1..^rad;
+    (" " ~ (SYM x (rad*2)-1)).say;
+    (" " x rad ~ SYM).say for 1..^rad;    
+}
-- 
cgit 


From 6d12a38472aa39e44be069f9600f9aa87c63699c Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Aug 2021 10:57:33 +0100
Subject: first pass at ch-2

---
 challenge-124/james-smith/perl/ch-2.pl | 31 +++++++++++++++++++++++--------
 1 file changed, 23 insertions(+), 8 deletions(-)

diff --git a/challenge-124/james-smith/perl/ch-2.pl b/challenge-124/james-smith/perl/ch-2.pl
index 2348c8b946..005a10e8f8 100644
--- a/challenge-124/james-smith/perl/ch-2.pl
+++ b/challenge-124/james-smith/perl/ch-2.pl
@@ -8,15 +8,30 @@ use Test::More;
 use Benchmark qw(cmpthese timethis);
 use Data::Dumper qw(Dumper);
 
-my @TESTS = (
-  [ 0, 1 ],
-);
-
-is( my_function($_->[0]), $_->[1] ) foreach @TESTS;
-
 done_testing();
 
-sub my_function {
-  return 1;
+match_teams( map { $_*10 } 1..10 );
+match_teams( qw(10 -15 20 30 -25 0 5 40 -5) );
+
+sub match_teams {
+  my @n = @_;
+  my $diff = shift @n;
+  my $best = [];
+  separate( \@n, 1 + int(@n/2), [$diff], [], $diff, $best );
+  say "Team 1: [@{$best->[0]}]; Team 2[@{$best->[1]}]; difference $best->[2]";
+  sub separate {
+    my($nums,$maxsize,$team1,$team2,$diff,$be) = @_;
+    if(@{$nums}==0) {
+      unless( defined $be->[0] && abs $diff>=$be->[2] ) {
+        $be->[0] = $team1;
+        $be->[1] = $team2;
+        $be->[2] = abs $diff;
+      }
+      return;
+    }
+    my $next = shift @{$nums};
+    separate( [@{$nums}], $maxsize, [@{$team1},$next], $team2, $diff+$next, $be ) if @{$team1} < $maxsize;
+    separate( [@{$nums}], $maxsize, $team1, [@{$team2},$next], $diff-$next, $be ) if @{$team2} < $maxsize;
+  }
 }
 
-- 
cgit 


From 7995d5f5700d575afe9554f8857d2bab02297c39 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 2 Aug 2021 13:44:32 +0200
Subject: Tests for week 124

---
 challenge-124/abigail/t/ctest.ini      | 8 ++++++++
 challenge-124/abigail/t/input-1-1      | 0
 challenge-124/abigail/t/input-2-1      | 2 ++
 challenge-124/abigail/t/output-2-1.exp | 4 ++++
 4 files changed, 14 insertions(+)
 create mode 100644 challenge-124/abigail/t/ctest.ini
 create mode 100644 challenge-124/abigail/t/input-1-1
 create mode 100644 challenge-124/abigail/t/input-2-1
 create mode 100644 challenge-124/abigail/t/output-2-1.exp

diff --git a/challenge-124/abigail/t/ctest.ini b/challenge-124/abigail/t/ctest.ini
new file mode 100644
index 0000000000..126831bc8e
--- /dev/null
+++ b/challenge-124/abigail/t/ctest.ini
@@ -0,0 +1,8 @@
+# 
+# Configuration file for running tests, using ctest.
+# See https://github.com/Abigail/Misc/blob/master/ctest
+# 
+
+[names]
+1-1 = Fixed output
+2-1 = Given Examples
diff --git a/challenge-124/abigail/t/input-1-1 b/challenge-124/abigail/t/input-1-1
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/challenge-124/abigail/t/input-2-1 b/challenge-124/abigail/t/input-2-1
new file mode 100644
index 0000000000..f4c3a07582
--- /dev/null
+++ b/challenge-124/abigail/t/input-2-1
@@ -0,0 +1,2 @@
+10 20 30 40 50 60 70 80 90 100
+10 -15 20 30 -25 0 5 40 -5
diff --git a/challenge-124/abigail/t/output-2-1.exp b/challenge-124/abigail/t/output-2-1.exp
new file mode 100644
index 0000000000..d97454eade
--- /dev/null
+++ b/challenge-124/abigail/t/output-2-1.exp
@@ -0,0 +1,4 @@
+30 40 60 70 80
+10 20 50 90 100
+30 0 5 -5
+10 -15 20 -25 40
-- 
cgit 


From 282c689388854d7ffbdfd9d621f54eb89d31efa8 Mon Sep 17 00:00:00 2001
From: Kjetil S <kjetilskotheim@gmail.com>
Date: Mon, 2 Aug 2021 13:58:09 +0200
Subject: challenge 124, ch-1.pl and ch-2.pl

---
 challenge-124/kjetillll/perl/ch-1.pl |  2 ++
 challenge-124/kjetillll/perl/ch-2.pl | 31 +++++++++++++++++++++++++++++++
 2 files changed, 33 insertions(+)
 create mode 100644 challenge-124/kjetillll/perl/ch-1.pl
 create mode 100644 challenge-124/kjetillll/perl/ch-2.pl

diff --git a/challenge-124/kjetillll/perl/ch-1.pl b/challenge-124/kjetillll/perl/ch-1.pl
new file mode 100644
index 0000000000..dbfb4cbf8a
--- /dev/null
+++ b/challenge-124/kjetillll/perl/ch-1.pl
@@ -0,0 +1,2 @@
+#!/usr/bin/env perl
+print qx(curl -si https://theweeklychallenge.org/blog/perl-weekly-challenge-124/)=~m|<code>([\s^]+)</code>| ? $1 : ''
diff --git a/challenge-124/kjetillll/perl/ch-2.pl b/challenge-124/kjetillll/perl/ch-2.pl
new file mode 100644
index 0000000000..17bf7bb83e
--- /dev/null
+++ b/challenge-124/kjetillll/perl/ch-2.pl
@@ -0,0 +1,31 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+
+sub sum{my$s;map$s+=$_,@_;$s}
+
+sub div{
+    my %least;
+    for my $div (0..2**@_-1){
+	my @ss=([],[]);
+	push( @{ $ss[$div%2] }, $_) and $div>>=1 for @_;
+	next if @{$ss[0]} != @{$ss[1]} + @_%2;
+	my $diff=abs( sum(@{$ss[0]}) - sum(@{$ss[1]}) );
+	%least=(diff=>$diff,subsets=>\@ss)
+	    if not exists $least{diff}
+	    or $diff < $least{diff};
+    }
+    @{$least{subsets}}
+}
+
+#Run on input list given as command line args
+#or two test cases if no input args is given.
+
+my @cases = @ARGV ? ( [@ARGV] )
+                  : ( [10, 20, 30, 40, 50, 60, 70, 80, 90, 100],
+		      [10, -15, 20, 30, -25, 0, 5, 40, -5] );
+for ( @cases ) {
+    print "-" x 50, "\n";
+    print "Input:   @$_\n";
+    print "Output sum ".sum(@$_).":   @$_\n" for div(@$_);
+}
-- 
cgit 


From e685df4fffef7af82623d6ec92a06fe7bc9f5139 Mon Sep 17 00:00:00 2001
From: Kjetil S <kjetilskotheim@gmail.com>
Date: Mon, 2 Aug 2021 14:11:23 +0200
Subject: challenge 124, ch-1.pl and ch-2.pl

---
 challenge-124/kjetillll/perl/README | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 challenge-124/kjetillll/perl/README

diff --git a/challenge-124/kjetillll/perl/README b/challenge-124/kjetillll/perl/README
new file mode 100644
index 0000000000..15198597ff
--- /dev/null
+++ b/challenge-124/kjetillll/perl/README
@@ -0,0 +1 @@
+Solution by kjetillll
-- 
cgit 


From bec1ced3637dd6309e4b844370107e29c8b724e9 Mon Sep 17 00:00:00 2001
From: Kjetil S <kjetilskotheim@gmail.com>
Date: Mon, 2 Aug 2021 14:12:44 +0200
Subject: challenge 124, ch-1.pl and ch-2.pl

---
 challenge-124/kjetillll/README      | 1 +
 challenge-124/kjetillll/perl/README | 1 -
 2 files changed, 1 insertion(+), 1 deletion(-)
 create mode 100644 challenge-124/kjetillll/README
 delete mode 100644 challenge-124/kjetillll/perl/README

diff --git a/challenge-124/kjetillll/README b/challenge-124/kjetillll/README
new file mode 100644
index 0000000000..15198597ff
--- /dev/null
+++ b/challenge-124/kjetillll/README
@@ -0,0 +1 @@
+Solution by kjetillll
diff --git a/challenge-124/kjetillll/perl/README b/challenge-124/kjetillll/perl/README
deleted file mode 100644
index 15198597ff..0000000000
--- a/challenge-124/kjetillll/perl/README
+++ /dev/null
@@ -1 +0,0 @@
-Solution by kjetillll
-- 
cgit 


From 5f95c54ed2bbe846d6341eec2a2cb38c567cc62c Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Aug 2021 08:20:07 -0400
Subject: 1st commit on 124_raku

---
 challenge-124/stuart-little/raku/ch-1.raku | 24 ++++++++++++++++++++++++
 challenge-124/stuart-little/raku/ch-2.raku | 22 ++++++++++++++++++++++
 2 files changed, 46 insertions(+)
 create mode 100755 challenge-124/stuart-little/raku/ch-1.raku
 create mode 100755 challenge-124/stuart-little/raku/ch-2.raku

diff --git a/challenge-124/stuart-little/raku/ch-1.raku b/challenge-124/stuart-little/raku/ch-1.raku
new file mode 100755
index 0000000000..bfd2a26910
--- /dev/null
+++ b/challenge-124/stuart-little/raku/ch-1.raku
@@ -0,0 +1,24 @@
+#!/usr/bin/env raku
+use v6;
+
+# run <script>
+
+say q:to/EOF/;
+    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+EOF
diff --git a/challenge-124/stuart-little/raku/ch-2.raku b/challenge-124/stuart-little/raku/ch-2.raku
new file mode 100755
index 0000000000..14c4ae87a4
--- /dev/null
+++ b/challenge-124/stuart-little/raku/ch-2.raku
@@ -0,0 +1,22 @@
+#!/usr/bin/env raku
+use v6;
+
+# run <script> <space-separated numbers>
+
+sub splt(@set) {
+    my $sm = @set.sum;
+    my @low = @set.combinations(@set.elems div 2).grep({ 2*$_.sum <= $sm }).max({ $_.sum }).Array;
+    my @high = (@set (-) @low).keys;
+    return @low, @high;
+}
+
+my @nums = (@*ARGS.elems %% 2) ?? (@*ARGS.map(*.Num)) !! ([0,|@*ARGS.map(*.Num)]);
+my ($low, $high) = @nums.&splt;
+(2*$low.elems > @*ARGS.elems && $low.grep({ $_ == 0}).elems) && do {
+    $low = ($low (-) (0)).keys.Array;
+} || (2*$high.elems > @*ARGS.elems && $high.grep({ $_ == 0}).elems) && do {
+    $high = ($high (-) (0)).keys.Array;
+}
+
+say $low;
+say $high;
-- 
cgit 


From 05acfcc1bac0582eddfc7e74b1c41c5ee007838e Mon Sep 17 00:00:00 2001
From: Roger Bell_West <roger@firedrake.org>
Date: Mon, 2 Aug 2021 13:32:20 +0100
Subject: Solutions for challenge #124

---
 challenge-124/roger-bell-west/perl/ch-1.pl       | 26 ++++++++++++++++
 challenge-124/roger-bell-west/perl/ch-2.pl       | 39 ++++++++++++++++++++++++
 challenge-124/roger-bell-west/postscript/ch-1.ps | 20 ++++++++++++
 challenge-124/roger-bell-west/python/ch-1.py     | 17 +++++++++++
 challenge-124/roger-bell-west/python/ch-2.py     | 31 +++++++++++++++++++
 challenge-124/roger-bell-west/raku/ch-1.p6       | 20 ++++++++++++
 challenge-124/roger-bell-west/raku/ch-2.p6       | 32 +++++++++++++++++++
 challenge-124/roger-bell-west/ruby/ch-1.rb       | 19 ++++++++++++
 challenge-124/roger-bell-west/ruby/ch-2.rb       | 35 +++++++++++++++++++++
 challenge-124/roger-bell-west/rust/ch-1.rs       | 22 +++++++++++++
 challenge-124/roger-bell-west/rust/ch-2.rs       | 37 ++++++++++++++++++++++
 11 files changed, 298 insertions(+)
 create mode 100755 challenge-124/roger-bell-west/perl/ch-1.pl
 create mode 100755 challenge-124/roger-bell-west/perl/ch-2.pl
 create mode 100644 challenge-124/roger-bell-west/postscript/ch-1.ps
 create mode 100755 challenge-124/roger-bell-west/python/ch-1.py
 create mode 100755 challenge-124/roger-bell-west/python/ch-2.py
 create mode 100755 challenge-124/roger-bell-west/raku/ch-1.p6
 create mode 100755 challenge-124/roger-bell-west/raku/ch-2.p6
 create mode 100755 challenge-124/roger-bell-west/ruby/ch-1.rb
 create mode 100755 challenge-124/roger-bell-west/ruby/ch-2.rb
 create mode 100755 challenge-124/roger-bell-west/rust/ch-1.rs
 create mode 100755 challenge-124/roger-bell-west/rust/ch-2.rs

diff --git a/challenge-124/roger-bell-west/perl/ch-1.pl b/challenge-124/roger-bell-west/perl/ch-1.pl
new file mode 100755
index 0000000000..02e957dd5c
--- /dev/null
+++ b/challenge-124/roger-bell-west/perl/ch-1.pl
@@ -0,0 +1,26 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use List::Util qw(max);
+
+my $char='^';
+my @shape=(3,-3,-4,-5,-5,-5,-5,-5,-4,-3,3,1,1,1,3,1,1);
+my $mx=max(map {abs($_)} @shape);
+
+foreach my $row (@shape) {
+  my $line;
+  if ($row>0) {
+    $line=$char x $row;
+  } else {
+    $line=(' ' x -$row).$char;
+  }
+  my $ll=length($line);
+  if ($ll <= $mx) {
+    $line .= ' ' x ($mx-$ll+1);
+  }
+  my $f=reverse $line;
+  substr($f,-1)='';
+  print "$f$line\n";
+}
diff --git a/challenge-124/roger-bell-west/perl/ch-2.pl b/challenge-124/roger-bell-west/perl/ch-2.pl
new file mode 100755
index 0000000000..8bd9d0c671
--- /dev/null
+++ b/challenge-124/roger-bell-west/perl/ch-2.pl
@@ -0,0 +1,39 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use Algorithm::Combinatorics qw(combinations);
+use List::Util qw(sum);
+
+tow([10, 20, 30, 40, 50, 60, 70, 80, 90, 100]);
+print "\n";
+
+tow([10, -15, 20, 30, -25, 0, 5, 40, -5]);
+
+sub tow {
+  my $n=shift;
+  my $target=int(sum(@{$n})/2);
+  my $k=int((scalar @{$n})/2);
+  my $bestval=-1;
+  my $bestset;
+  foreach my $set (combinations($n,$k)) {
+    my $l=abs($target-sum(@{$set}));
+    if ($bestval<0 || $l < $bestval) {
+      $bestval=$l;
+      $bestset=[@{$set}];
+    }
+  }
+  my @o=([],[]);
+  my %r=map {$_ => 1} @{$bestset};
+  foreach my $m (@{$n}) {
+    if (exists $r{$m}) {
+      push @{$o[1]},$m;
+    } else {
+      push @{$o[0]},$m;
+    }
+  }
+  foreach my $i (0,1) {
+    print "(",join(', ',@{$o[$i]}),")\n";
+  }
+}
diff --git a/challenge-124/roger-bell-west/postscript/ch-1.ps b/challenge-124/roger-bell-west/postscript/ch-1.ps
new file mode 100644
index 0000000000..ea526ab327
--- /dev/null
+++ b/challenge-124/roger-bell-west/postscript/ch-1.ps
@@ -0,0 +1,20 @@
+%!
+
+10 setlinewidth
+
+gsave
+300 300 translate
+
+/size 100 def
+
+newpath
+0 0 size 0 360 arc
+0 size neg moveto
+0 size neg 2 mul lineto
+size neg 2 div size neg 1.5 mul moveto
+size 2 div size neg 1.5 mul lineto
+stroke
+
+grestore
+
+showpage
diff --git a/challenge-124/roger-bell-west/python/ch-1.py b/challenge-124/roger-bell-west/python/ch-1.py
new file mode 100755
index 0000000000..61b9eddc7f
--- /dev/null
+++ b/challenge-124/roger-bell-west/python/ch-1.py
@@ -0,0 +1,17 @@
+#! /usr/bin/python3
+
+char="^"
+shape=[3,-3,-4,-5,-5,-5,-5,-5,-4,-3,3,1,1,1,3,1,1]
+mx=max(abs(i) for i in shape)
+
+for row in shape:
+    if row>0:
+        line=char * row
+    else:
+        line=(" "* -row) + char
+    ll=len(line)
+    if ll <= mx:
+        line += " " * (mx-ll+1)
+    f=line[1:]
+    f=f[::-1]
+    print(f+line)
diff --git a/challenge-124/roger-bell-west/python/ch-2.py b/challenge-124/roger-bell-west/python/ch-2.py
new file mode 100755
index 0000000000..8867ab1a2d
--- /dev/null
+++ b/challenge-124/roger-bell-west/python/ch-2.py
@@ -0,0 +1,31 @@
+#! /usr/bin/python3
+
+from itertools import combinations
+
+def tow(n):
+    target=int(sum(n)/2)
+    k=int(len(n)/2)
+    bestval=-1
+    bestset=[]
+    for set in combinations(n,k):
+        l=abs(target-sum(set))
+        if bestval < 0 or l < bestval:
+            bestval=l
+            bestset=set
+    o=[[],[]]
+    r=dict()
+    for i in bestset:
+        r[i]=1
+    for m in n:
+        if m in r:
+            o[1].append(m)
+        else:
+            o[0].append(m)
+    for i in range(2):
+        print("(" + ", ".join([str(j) for j in o[i]]) + ")")
+
+
+tow([10, 20, 30, 40, 50, 60, 70, 80, 90, 100])
+print("")
+
+tow([10, -15, 20, 30, -25, 0, 5, 40, -5])
diff --git a/challenge-124/roger-bell-west/raku/ch-1.p6 b/challenge-124/roger-bell-west/raku/ch-1.p6
new file mode 100755
index 0000000000..462ebb6407
--- /dev/null
+++ b/challenge-124/roger-bell-west/raku/ch-1.p6
@@ -0,0 +1,20 @@
+#! /usr/bin/perl6
+
+my $char='^';
+my @shape=(3,-3,-4,-5,-5,-5,-5,-5,-4,-3,3,1,1,1,3,1,1);
+my $mx=max(map {abs($_)},@shape);
+
+for @shape -> $row {
+  my $line;
+  if ($row>0) {
+    $line=$char x $row;
+  } else {
+    $line=(' ' x -$row)~$char;
+  }
+  my $ll=chars($line);
+  if ($ll <= $mx) {
+    $line ~= ' ' x ($mx-$ll+1);
+  }
+  my $f=$line.substr(1).flip;
+  print "$f$line\n";
+}
diff --git a/challenge-124/roger-bell-west/raku/ch-2.p6 b/challenge-124/roger-bell-west/raku/ch-2.p6
new file mode 100755
index 0000000000..8b899e6f45
--- /dev/null
+++ b/challenge-124/roger-bell-west/raku/ch-2.p6
@@ -0,0 +1,32 @@
+#! /usr/bin/perl6
+
+tow([10, 20, 30, 40, 50, 60, 70, 80, 90, 100]);
+say "";
+
+tow([10, -15, 20, 30, -25, 0, 5, 40, -5]);
+
+sub tow(@n) {
+  my $target=floor(sum(@n)/2);
+  my $k=floor((@n.elems)/2);
+  my $bestval=-1;
+  my @bestset;
+  for combinations(@n,$k) -> @set {
+    my $l=abs($target-@set.sum());
+    if ($bestval < 0 || $l < $bestval) {
+      $bestval=$l;
+      @bestset=@set.clone;
+    }
+  }
+  my @o=([],[]);
+  my %r=map {$_ => 1},@bestset;
+  for @n -> $m {
+    if (%r{$m}:exists) {
+      push @o[1],$m;
+    } else {
+      push @o[0],$m;
+    }
+  }
+  for (0,1) -> $i {
+    say "(" ~ @o[$i].join(', ') ~ ")";
+  }
+}
diff --git a/challenge-124/roger-bell-west/ruby/ch-1.rb b/challenge-124/roger-bell-west/ruby/ch-1.rb
new file mode 100755
index 0000000000..4aa67a36cd
--- /dev/null
+++ b/challenge-124/roger-bell-west/ruby/ch-1.rb
@@ -0,0 +1,19 @@
+#! /usr/bin/ruby
+
+char="^"
+shape=[3,-3,-4,-5,-5,-5,-5,-5,-4,-3,3,1,1,1,3,1,1]
+mx=shape.map{|i|i.abs}.max
+
+shape.each do |row|
+  if row>0 then
+    line=char * row
+  else
+    line=(" " * -row) + char
+  end
+  ll=line.length
+  if ll <= mx then
+    line += " " * (mx-ll+1)
+  end
+  f=line[1..-1].reverse
+  print(f+line+"\n")
+end
diff --git a/challenge-124/roger-bell-west/ruby/ch-2.rb b/challenge-124/roger-bell-west/ruby/ch-2.rb
new file mode 100755
index 0000000000..363e3b9b00
--- /dev/null
+++ b/challenge-124/roger-bell-west/ruby/ch-2.rb
@@ -0,0 +1,35 @@
+#! /usr/bin/ruby
+
+def tow(n)
+  target=(n.sum()/2).to_i
+  k=(n.length()/2).to_i
+  bestval=-1
+  bestset=[]
+  n.combination(k).each do |set|
+    l=(target-set.sum()).abs()
+    if bestval < 0 || l < bestval then
+      bestval=l
+      bestset=set
+    end
+  end
+  o=[[],[]]
+  r=Hash.new
+  bestset.each do |i|
+    r[i]=1
+  end
+  n.each do |m|
+    if r.has_key?(m) then
+      o[1].push(m)
+    else
+      o[0].push(m)
+    end
+  end
+  0.upto(1) do |i|
+    print("(#{o[i].map{|j| j.to_s}.join(', ')})\n")
+  end
+end
+
+tow([10, 20, 30, 40, 50, 60, 70, 80, 90, 100])
+print("\n")
+
+tow([10, -15, 20, 30, -25, 0, 5, 40, -5])
diff --git a/challenge-124/roger-bell-west/rust/ch-1.rs b/challenge-124/roger-bell-west/rust/ch-1.rs
new file mode 100755
index 0000000000..3e922d7088
--- /dev/null
+++ b/challenge-124/roger-bell-west/rust/ch-1.rs
@@ -0,0 +1,22 @@
+#! /bin/sh
+//usr/bin/env rustc $0 -o ${0}x && ./${0}x; rm -f ${0}x ; exit
+
+fn main() {
+    let chr="^";
+    let shape: Vec<i8>=vec![3,-3,-4,-5,-5,-5,-5,-5,-4,-3,3,1,1,1,3,1,1];
+    let mx: usize=shape.clone().into_iter().map(|i| i.abs()).max().unwrap() as usize;
+    for row in shape {
+        let mut line;
+        if row>0 {
+            line=(0..row).map(|_| chr).collect::<String>();
+        } else {
+            line=(0..-row).map(|_| " ").collect::<String>() + chr;
+        }
+        let ll=line.len();
+        if ll <= mx {
+            line += &(0..mx-ll+1).map(|_| " ").collect::<String>();
+        }
+        let f: String=line[1..].chars().rev().collect();
+        println!("{}{}",f,line);
+    }
+}
diff --git a/challenge-124/roger-bell-west/rust/ch-2.rs b/challenge-124/roger-bell-west/rust/ch-2.rs
new file mode 100755
index 0000000000..5b1b4248a6
--- /dev/null
+++ b/challenge-124/roger-bell-west/rust/ch-2.rs
@@ -0,0 +1,37 @@
+use std::collections::HashSet;
+use permutator::Combination;
+
+fn main() {
+    tow(vec![10, 20, 30, 40, 50, 60, 70, 80, 90, 100]);
+    println!("");
+    tow(vec![10, -15, 20, 30, -25, 0, 5, 40, -5]);
+}
+
+fn tow(n: Vec<i64>) {
+    let target: i64=n.iter().sum::<i64>()/2;
+    let k: usize=n.len()/2;
+    let mut bestval: i64=-1;
+    let mut bestset: Vec<i64>=vec![];
+    n.combination(k).for_each(|set| {
+        let l: i64=(target-set.iter().map(|i| **i).sum::<i64>()).abs();
+        if bestval < 0 || l < bestval {
+            bestval=l;
+            bestset=set.iter().map(|i| **i).collect();
+        }
+    });
+    let mut o=vec![vec![],vec![]];
+    let mut r: HashSet<i64>=HashSet::new();
+    for i in bestset {
+        r.insert(i);
+    }
+    for m in n {
+        if r.contains(&m) {
+            o[1].push(m);
+        } else {
+            o[0].push(m);
+        }
+    }
+    for i in 0..=1 {
+        println!("({})",o[i].iter().map(|j| j.to_string()).collect::<Vec<String>>().join(", "));
+    }
+}
-- 
cgit 


From 0f4411f0fb3481575d565fdac12eefabf8b4b472 Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Aug 2021 09:00:06 -0400
Subject: 1st commit on 124_perl

---
 challenge-124/stuart-little/perl/ch-1.pl | 26 ++++++++++++++++++++++++++
 challenge-124/stuart-little/perl/ch-2.pl | 22 ++++++++++++++++++++++
 2 files changed, 48 insertions(+)
 create mode 100755 challenge-124/stuart-little/perl/ch-1.pl
 create mode 100755 challenge-124/stuart-little/perl/ch-2.pl

diff --git a/challenge-124/stuart-little/perl/ch-1.pl b/challenge-124/stuart-little/perl/ch-1.pl
new file mode 100755
index 0000000000..36e1931171
--- /dev/null
+++ b/challenge-124/stuart-little/perl/ch-1.pl
@@ -0,0 +1,26 @@
+#!/usr/bin/env perl
+use warnings;
+use v5.12;
+
+# run <script>
+
+my $msg = <<"EOF";
+    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+EOF
+say $msg;
diff --git a/challenge-124/stuart-little/perl/ch-2.pl b/challenge-124/stuart-little/perl/ch-2.pl
new file mode 100755
index 0000000000..8626ddbc13
--- /dev/null
+++ b/challenge-124/stuart-little/perl/ch-2.pl
@@ -0,0 +1,22 @@
+#!/usr/bin/env perl
+use warnings;
+use v5.12;
+
+# run <script> <space-separated numbers>
+
+use feature qw(signatures);
+no warnings qw(experimental::signatures);
+
+use Data::PowerSet qw(powerset);
+use List::AllUtils qw(sum0 min_by);
+use Set::Scalar;
+
+sub splt($ar) {
+    my $powerSet = powerset({min => int(scalar @{$ar}/2), max => int(scalar @{$ar}/2)}, @{$ar});
+    my $set = Set::Scalar->new(@{$ar});
+    return min_by {abs((sum0 @{$_->[0]}) - (sum0 @{$_->[1]}))} map {my @diff = $set->difference(Set::Scalar->new(@{$_}))->members; [$_, \@diff]} @{$powerSet};
+}
+
+my $splt = splt(\@ARGV);
+say "@{$splt->[0]}";
+say "@{$splt->[1]}";
-- 
cgit 


From a02491766b56fca83d4caabb24c9e65b9a665851 Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 2 Aug 2021 15:16:51 +0200
Subject: README for week 124

---
 challenge-124/abigail/README.md | 81 ++++++++++++++++++++---------------------
 1 file changed, 39 insertions(+), 42 deletions(-)

diff --git a/challenge-124/abigail/README.md b/challenge-124/abigail/README.md
index e71bda7e0f..96ce515677 100644
--- a/challenge-124/abigail/README.md
+++ b/challenge-124/abigail/README.md
@@ -1,21 +1,27 @@
 # Solutions by Abigail
-## [Ugly Numbers][task1]
+## [Happy Women Day][task1]
 
-> You are given an integer `$n >= 1`.
-> 
-> Write a script to find the $nth element of Ugly Numbers.
-> 
-> > Ugly numbers are those number whose prime factors are `2`, `3` or `5`.
-> > For example, the first 10 Ugly Numbers are `1`, `2`, `3`, `4`, `5`,
-> > `6`, `8`, `9`, `10`, `12`.
+> Write a script to print the Venus Symbol, international gender symbol
+> for women. Please feel free to use any character.
 
-### Examples
 ~~~~
-Input: $n = 7
-Output: 8
-
-Input: $n = 10
-Output: 12
+    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
 ~~~~
 
 ### Solutions
@@ -30,55 +36,46 @@ Output: 12
 * [Ruby](ruby/ch-1.rb)
 
 ### Blog
-[Perl Weekly Challenge 123: Ugly Numbers][blog1]
+[Perl Weekly Challenge 124: Happy Women Day][blog1]
 
-## [Square Points][task2]
+## [Tug of War][task2]
 
-> You are given coordinates of four points i.e. `(x1, y1)`, `(x2, y2)`,
-> `(x3, y3)` and `(x4, y4)`.
-> 
-> Write a script to find out if the given four points form a square.
+> You are given a set of $n integers `(n1, n2, n3, ...)`.
+>
+> Write a script to divide the set in two subsets of `n/2` sizes each
+> so that the difference of the sum of two subsets is the least. If
+> `$n` is even then each subset must be of size `$n/2` each. In case $n
+> is odd then one subset must be `($n-1)/2` and other must be `($n+1)/2`.
 
 ### Examples
 ~~~~
-Input: x1 = 10, y1 = 20
-       x2 = 20, y2 = 20
-       x3 = 20, y3 = 10
-       x4 = 10, y4 = 10
-Output: 1 as the given coordinates form a square.
+Input:        Set = (10, 20, 30, 40, 50, 60, 70, 80, 90, 100)
+Output:  Subset 1 = (30, 40, 60, 70, 80)
+         Subset 2 = (10, 20, 50, 90, 100)
 ~~~~
 
 ~~~~
-Input: x1 = 12, y1 = 24
-       x2 = 16, y2 = 10
-       x3 = 20, y3 = 12
-       x4 = 18, y4 = 16
-Output: 0 as the given coordinates doesn't form a square.
+Input:        Set = (10, -15, 20, 30, -25, 0, 5, 40, -5)
+         Subset 1 = (30, 0, 5, -5)
+         Subset 2 = (10, -15, 20, -25, 40)
 ~~~~
 
 ### Solutions
 * [AWK](awk/ch-2.awk)
 * [Bash](bash/ch-2.sh)
-* [bc](bc/ch-2.bc)
 * [C](c/ch-2.c)
-* [Go](go/ch-2.go)
-* [Java](java/ch-2.java)
 * [Lua](lua/ch-2.lua)
 * [Node.js](node/ch-2.js)
-* [Pascal](pascal/ch-2.p)
 * [Perl](perl/ch-2.pl)
 * [Python](python/ch-2.py)
-* [R](r/ch-2.r)
 * [Ruby](ruby/ch-2.rb)
-* [Scheme](scheme/ch-2.scm)
-* [Tcl](tcl/ch-2.tcl)
 
 ### Blog
-[Perl Weekly Challenge 123: Square Points][blog2]
+[Perl Weekly Challenge 124: Tug of War][blog2]
 
 
 
-[task1]: https://perlweeklychallenge.org/blog/perl-weekly-challenge-123/#TASK1
-[task2]: https://perlweeklychallenge.org/blog/perl-weekly-challenge-123/#TASK2
-[blog1]: https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-123-1.html
-[blog2]: https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-123-2.html
+[task1]: https://perlweeklychallenge.org/blog/perl-weekly-challenge-124/#TASK1
+[task2]: https://perlweeklychallenge.org/blog/perl-weekly-challenge-124/#TASK2
+[blog1]: https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-124-1.html
+[blog2]: https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-124-2.html
-- 
cgit 


From 71b4d0b701eb897bb4cafb5e653298ae1e29aaea Mon Sep 17 00:00:00 2001
From: Simon Green <mail@simon.green>
Date: Mon, 2 Aug 2021 23:40:16 +1000
Subject: sgreen solution to task 2 challenge 124

---
 challenge-124/sgreen/perl/ch-2.pl | 89 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 89 insertions(+)
 create mode 100755 challenge-124/sgreen/perl/ch-2.pl

diff --git a/challenge-124/sgreen/perl/ch-2.pl b/challenge-124/sgreen/perl/ch-2.pl
new file mode 100755
index 0000000000..6a955f9654
--- /dev/null
+++ b/challenge-124/sgreen/perl/ch-2.pl
@@ -0,0 +1,89 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+use feature 'say';
+
+use List::Util qw(none sum);
+
+sub _get_next_combination {
+    my ( $size, @combination ) = @_;
+
+    # First time run
+    if ( scalar(@combination) == 0 ) {
+        my $half_size = int( $size / 2 );
+        return ( 0 .. $half_size - 1 );
+    }
+
+    # How many numbers do we need to change
+    my $count = 0;
+    while ( ++$count ) {
+        last if $combination[ -$count ] < $size - $count;
+
+        # There are no more combinations
+        return if $count == int( $size / 2 );
+    }
+
+    # Add one to the first number
+    $combination[ -$count ]++;
+
+    # If there is any other numbers to change, add 1 from the previous digit
+    foreach my $i ( $#combination - $count + 2 .. $#combination ) {
+        $combination[$i] = $combination[ $i - 1 ] + 1;
+    }
+
+    return @combination;
+}
+
+sub main {
+    my @values = @_;
+    my $size   = @values;
+
+    # Sanity check
+    die "You must provide two or more integers\n" unless $size > 1;
+    foreach my $x (@values) {
+        die "The value '$x does not appear to be a integer\n" unless $x =~ /^-?[0-9]+$/;
+    }
+
+    # Get half the sum of all the numbers. This is the target we want to
+    #  hit for one of the sets.
+    my $target = sum(@values) / 2;
+
+    # This records the best set we've found so far.
+    my $best_sum    = 'inf';
+    my @first_set   = ();
+    my @combination = ();
+
+    # Go through all possible combinations of the first set
+    while ( @combination = _get_next_combination( $size, @combination ) ) {
+
+        # Calculate the difference between the sum of this set and the target
+        my $sum  = sum( @values[@combination] );
+        my $diff = abs( $sum - $target );
+
+        if ( $diff == 0 ) {
+            # We've find the best combination
+            @first_set = @combination;
+            last;
+        }
+        elsif ( $diff < $best_sum ) {
+            # We've found a better combination
+            $best_sum  = $diff;
+            @first_set = @combination;
+        }
+
+    }
+
+    # Get the second set (everything not in the first set!)
+    my @second_set = grep {
+        my $i = $_;
+        none { $i == $_ } @first_set
+    } ( 0 .. $#values );
+
+    # Print the results
+    say 'Subset 1 = (', join( ', ', @values[@first_set] ),  ')';
+    say 'Subset 2 = (', join( ', ', @values[@second_set] ), ')';
+
+}
+
+main(@ARGV);
-- 
cgit 


From a30cb1b9a1bde61934e25e6166e7ee605a470587 Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Aug 2021 09:23:48 -0400
Subject: 1st commit on 124_python

---
 challenge-124/stuart-little/python/ch-1.py | 23 +++++++++++++++++++++++
 challenge-124/stuart-little/python/ch-2.py | 12 ++++++++++++
 2 files changed, 35 insertions(+)
 create mode 100755 challenge-124/stuart-little/python/ch-1.py
 create mode 100755 challenge-124/stuart-little/python/ch-2.py

diff --git a/challenge-124/stuart-little/python/ch-1.py b/challenge-124/stuart-little/python/ch-1.py
new file mode 100755
index 0000000000..b8d831813b
--- /dev/null
+++ b/challenge-124/stuart-little/python/ch-1.py
@@ -0,0 +1,23 @@
+#!/usr/bin/env python
+
+# run <script>
+
+print("""
+    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+""")
diff --git a/challenge-124/stuart-little/python/ch-2.py b/challenge-124/stuart-little/python/ch-2.py
new file mode 100755
index 0000000000..0da114bb30
--- /dev/null
+++ b/challenge-124/stuart-little/python/ch-2.py
@@ -0,0 +1,12 @@
+#!/usr/bin/env python
+
+# run <script> <space-separated numbers>
+
+from itertools import combinations
+import sys
+
+def splt(nums):
+    return(min([(cmb,tuple(set(nums).difference(cmb))) for cmb in combinations(nums,len(nums)//2)], key=lambda tup: abs(sum(tup[0]) - sum(tup[1]))))
+
+for ar in splt([int(x) for x in sys.argv[1:]]):
+    print(ar)
-- 
cgit 


From a136e4532222902b29939c840d98978c3ce9f24f Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Aug 2021 09:59:10 -0400
Subject: 1st commit on 124_node

---
 challenge-124/stuart-little/node/ch-1.js | 23 +++++++++++++++++++++++
 challenge-124/stuart-little/node/ch-2.js | 15 +++++++++++++++
 2 files changed, 38 insertions(+)
 create mode 100755 challenge-124/stuart-little/node/ch-1.js
 create mode 100755 challenge-124/stuart-little/node/ch-2.js

diff --git a/challenge-124/stuart-little/node/ch-1.js b/challenge-124/stuart-little/node/ch-1.js
new file mode 100755
index 0000000000..3a5c70ff8f
--- /dev/null
+++ b/challenge-124/stuart-little/node/ch-1.js
@@ -0,0 +1,23 @@
+#!/usr/bin/env node
+
+// run <script>
+
+console.log(`
+    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+`)
diff --git a/challenge-124/stuart-little/node/ch-2.js b/challenge-124/stuart-little/node/ch-2.js
new file mode 100755
index 0000000000..70aaa0deeb
--- /dev/null
+++ b/challenge-124/stuart-little/node/ch-2.js
@@ -0,0 +1,15 @@
+#!/usr/bin/env node
+
+// run <script> <space-separated numbers>
+
+const { minBy, sum } = require('lodash')
+const { difference } = require('set-operations')
+const ps = require('power-set-x').default
+
+function splt(nums) {
+    return minBy(ps(nums).filter(x => x.length === Math.floor(nums.length/2)).map(x => [x, Array.from(difference(nums,x))]), x => Math.abs(sum(x[0])-sum(x[1])))
+}
+
+const [l,r] = splt(process.argv.slice(2).map(x => parseInt(x)))
+console.log(l)
+console.log(r)
-- 
cgit 


From 765064aaf763bbad8433d691a61e46fa9d1a7f7a Mon Sep 17 00:00:00 2001
From: Luca Ferrari <fluca1978@gmail.com>
Date: Mon, 2 Aug 2021 16:04:16 +0200
Subject: Task 1 done.

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

diff --git a/challenge-124/luca-ferrari/raku/ch-1.p6 b/challenge-124/luca-ferrari/raku/ch-1.p6
new file mode 100644
index 0000000000..90904038c3
--- /dev/null
+++ b/challenge-124/luca-ferrari/raku/ch-1.p6
@@ -0,0 +1,27 @@
+#!raku
+
+sub MAIN() {
+    
+    my $venus = qq:to/EOF/;
+          ^^^^^
+         ^     ^
+        ^       ^
+       ^         ^
+      ^          ^
+      ^         ^
+      ^        ^
+      ^       ^
+      ^      ^
+      ^      ^
+       ^^^^^
+         ^
+         ^
+         ^
+       ^^^^^
+         ^
+         ^
+EOF
+
+$venus.say;
+
+}
-- 
cgit 


From 2b9d1af70dce43af5a6145443060028033a62b88 Mon Sep 17 00:00:00 2001
From: chirvasitua <chirvasitua@gmail.com>
Date: Mon, 2 Aug 2021 10:54:23 -0400
Subject: 1st commit on 124_haskell

---
 challenge-124/stuart-little/haskell/ch-1.hs | 30 +++++++++++++++++++++++++++++
 challenge-124/stuart-little/haskell/ch-2.hs | 14 ++++++++++++++
 2 files changed, 44 insertions(+)
 create mode 100755 challenge-124/stuart-little/haskell/ch-1.hs
 create mode 100755 challenge-124/stuart-little/haskell/ch-2.hs

diff --git a/challenge-124/stuart-little/haskell/ch-1.hs b/challenge-124/stuart-little/haskell/ch-1.hs
new file mode 100755
index 0000000000..ba1ead5bd5
--- /dev/null
+++ b/challenge-124/stuart-little/haskell/ch-1.hs
@@ -0,0 +1,30 @@
+#!/usr/bin/env runghc
+
+-- run <script>
+
+{-# LANGUAGE QuasiQuotes #-}
+import Text.RawString.QQ
+
+multi :: String
+multi = [r|    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+|]
+
+main :: IO ()
+main = putStrLn multi
+  
diff --git a/challenge-124/stuart-little/haskell/ch-2.hs b/challenge-124/stuart-little/haskell/ch-2.hs
new file mode 100755
index 0000000000..d4fb7ff1cc
--- /dev/null
+++ b/challenge-124/stuart-little/haskell/ch-2.hs
@@ -0,0 +1,14 @@
+#!/usr/bin/env runghc
+
+-- run <script> <space-separated numbers>
+
+import Combinatorics (tuples)
+import Data.List ((\\), )
+import Data.List.Extra (minimumOn)
+import System.Environment (getArgs)
+
+splt :: (Eq a,Num a,Ord a) => [a] -> [[a]]
+splt xs = minimumOn (\p-> abs ((sum $ head p)-(sum $ last p))) $ map (\tp-> [tp, xs\\tp]) $ tuples (div (length xs) 2) xs
+
+main :: IO ()
+main = getArgs >>= putStrLn . unlines . map unwords . (map.map) show . splt . map (read::String->Int)
-- 
cgit 


From 2853996c0f92eed1f426abd287080d9866d7b169 Mon Sep 17 00:00:00 2001
From: Mark A <andemark@a-iot1t.uch.ad.pvt>
Date: Mon, 2 Aug 2021 09:12:15 -0600
Subject: ch-2.raku

---
 challenge-124/mark-anderson/raku/ch-2.raku | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/challenge-124/mark-anderson/raku/ch-2.raku b/challenge-124/mark-anderson/raku/ch-2.raku
index 6762d2c45e..d2e8fbe417 100644
--- a/challenge-124/mark-anderson/raku/ch-2.raku
+++ b/challenge-124/mark-anderson/raku/ch-2.raku
@@ -7,12 +7,11 @@ sub tug-of-war(+$list)
 {
     my $n = $list.elems div 2;
 
-    my %h = $list.combinations($n).map(-> @a
+    my %h = $list.combinations($n).map(-> $a
     {
-        my @b = ($list (-) @a).keys;
-
-        abs(@b.sum - @a.sum) => @a ~ ' ' ~ @b;
+        my $b = ($list (-) $a).keys.List;
+        abs($b.sum - $a.sum) => ($a, $b);
     });
 
-    .head($n), .tail(* - $n) with %h.min.value.split(/\s/).cache;
+    %h.min.value;
 }
-- 
cgit 


From c792fb0054e306729043275fef778d4d229b5d1b Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Aug 2021 16:53:24 +0100
Subject: add tweak to avoid too many duplicate points by only doing roughly
 1/8 of the circle! - and use a radius of r-1/2 to get a better set of points
 {due to rounding...}

---
 challenge-124/james-smith/perl/ch-1.pl | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/challenge-124/james-smith/perl/ch-1.pl b/challenge-124/james-smith/perl/ch-1.pl
index 98695a06ea..34cdf2cd64 100644
--- a/challenge-124/james-smith/perl/ch-1.pl
+++ b/challenge-124/james-smith/perl/ch-1.pl
@@ -7,6 +7,7 @@ use feature qw(say);
 use Test::More;
 use Benchmark qw(cmpthese timethis);
 use Data::Dumper qw(Dumper);
+use POSIX qw(ceil);
 my $tau = 6.283185307179586476925286766559;
 
 
@@ -31,8 +32,8 @@ unless($radius) {
 my @a = map { ' ' x ($radius*2+1) } 0..$radius*2+$cross;
 
 ## Now we draw the circle...
-foreach my $x (0..$radius) {
-  my $y = int sqrt( $radius**2 - $x**2 );
+foreach my $x (0 .. ceil($radius*0.71)) {
+  my $y = int sqrt( ($radius-.5)**2 - $x**2 );
   substr $a[ $radius - $x ],$radius-$y,1,'^';
   substr $a[ $radius + $x ],$radius-$y,1,'^';
   substr $a[ $radius - $x ],$radius+$y,1,'^';
-- 
cgit 


From 1f7d8bab1e6f523753ace54ed509358768f43eb8 Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Aug 2021 16:53:53 +0100
Subject: add other tests and some timing loops to compare performance

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

diff --git a/challenge-124/james-smith/perl/ch-2.pl b/challenge-124/james-smith/perl/ch-2.pl
index 005a10e8f8..b1104a1615 100644
--- a/challenge-124/james-smith/perl/ch-2.pl
+++ b/challenge-124/james-smith/perl/ch-2.pl
@@ -9,16 +9,28 @@ use Benchmark qw(cmpthese timethis);
 use Data::Dumper qw(Dumper);
 
 done_testing();
+say match_teams( map { $_*10 } 1..15 );
+say match_teams( map { $_*10 } 1..10 );
+say match_teams( qw(10 -15 20 30 -25 0 5 40 -5) );
+say match_teams( qw(2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97) );
 
-match_teams( map { $_*10 } 1..10 );
-match_teams( qw(10 -15 20 30 -25 0 5 40 -5) );
-
+timethis(1_000, sub { match_teams( map { $_*10 } 1..10 ); } );
+timethis(1_000, sub { match_teams( map { $_*10 } 1..12 ); } );
+timethis(1_000, sub { match_teams( map { $_*10 } 1..14 ); } );
+timethis(100, sub { match_teams( map { $_*10 } 1..16 ); } );
+timethis(100, sub { match_teams( map { $_*10 } 1..18 ); } );
+timethis(100, sub { match_teams( map { $_*10 } 1..20 ); } );
+timethis(10, sub { match_teams( map { $_*10 } 1..22 ); } );
+timethis(10, sub { match_teams( map { $_*10 } 1..24 ); } );
+timethis(5, sub { match_teams( map { $_*10 } 1..26 ); } );
+timethis(5, sub { match_teams( map { $_*10 } 1..28 ); } );
+timethis(5, sub { match_teams( map { $_*10 } 1..30 ); } );
 sub match_teams {
   my @n = @_;
   my $diff = shift @n;
   my $best = [];
   separate( \@n, 1 + int(@n/2), [$diff], [], $diff, $best );
-  say "Team 1: [@{$best->[0]}]; Team 2[@{$best->[1]}]; difference $best->[2]";
+  return "Team 1: [@{$best->[0]}]; Team 2[@{$best->[1]}]; difference $best->[2]";
   sub separate {
     my($nums,$maxsize,$team1,$team2,$diff,$be) = @_;
     if(@{$nums}==0) {
@@ -35,3 +47,19 @@ sub match_teams {
   }
 }
 
+##
+## Timings
+##
+## #players  rate
+##
+##  10       2,273/s
+##  12         598/s
+##  14         157/s
+##  16          41/s
+##  18          10/s
+##  20        2.68/s
+##  22        0.57/s
+##  24    ~    6s
+##  26    ~   23s
+##  28    ~   94s
+##  30    ~  365s
-- 
cgit 


From 1859c8113d7656500bc45abb8790d479a33a985e Mon Sep 17 00:00:00 2001
From: Peter Campbell Smith <pj.campbell.smith@gmail.com>
Date: Mon, 2 Aug 2021 17:18:45 +0100
Subject: Solution to challenge 024

---
 challenge-024/peter-campbell-smith/README  |  2 +
 challenge-024/peter-campbell-smith/ch-2.pl | 71 ++++++++++++++++++++++++++++++
 2 files changed, 73 insertions(+)
 create mode 100644 challenge-024/peter-campbell-smith/README
 create mode 100755 challenge-024/peter-campbell-smith/ch-2.pl

diff --git a/challenge-024/peter-campbell-smith/README b/challenge-024/peter-campbell-smith/README
new file mode 100644
index 0000000000..bb1d5dda17
--- /dev/null
+++ b/challenge-024/peter-campbell-smith/README
@@ -0,0 +1,2 @@
+Solution by Peter Campbell Smith
+
diff --git a/challenge-024/peter-campbell-smith/ch-2.pl b/challenge-024/peter-campbell-smith/ch-2.pl
new file mode 100755
index 0000000000..247e04a2f6
--- /dev/null
+++ b/challenge-024/peter-campbell-smith/ch-2.pl
@@ -0,0 +1,71 @@
+#!/usr/bin/perl
+
+# Peter Campbell Smith : 2021-08-02
+
+use strict;
+use utf8;
+use warnings;
+
+use Algorithm::Combinatorics qw(combinations);
+
+# Required: You are given a set of $n integers (n1, n2, n3, ….).
+
+# Write a script to divide the set in two subsets of n/2 sizes each so that the difference 
+# of the sum of two subsets is the least. If $n is even then each subset must be of size $n/2
+# each. In case $n is odd then one subset must be ($n-1)/2 and other must be ($n+1)/2.
+
+# Method:
+# The aim is to find a subset of $n/2 (or ($n-1)/2) of the input numbers which sums as close as
+# possible to half the sum of the input set (the 'target'). The remaining subset will then sum to 
+# a value the same distance from the other side of the target.
+
+my (@in, @out1, @out2, $target, $count, $subcount, $best, $set, $c, $total, $gap, $i, $string);
+
+# input set - uncomment one of these
+# @in = (10, 20, 30, 40, 50, 60, 70, 80, 90, 100);   # example 1 given in challenge
+# @in = (10, -15, 20, 30, -25, 0, 5, 40, -5);
+# @in = (18, 25, 7, 39, 11, 17, 22, 1 ,41, 19, -5);
+@in = (23, 67, 43, 96, 23, 14, 85, -300, 43, 20, 87, 99, 0, 35, 21, 77, 88, 77, 54, 70, 34, 56, 500);
+
+# some useful numbers
+$target = total(@in) / 2;   	# target value for each subset to add up to (half the total of the input numbers)
+$count = scalar @in;        	# number of numbers
+$subcount = int($count / 2);  	# number in each (or the smaller) subset
+
+# look for subset that is closest to the target
+$best = 1e10;   	# the closest gap found so far between the chosen combination and the target.
+
+# iterate over all possible combinations of the first $subcount numbers
+$set = combinations(\@in, $subcount);   
+while ($c = $set->next) {
+    $total = total(@$c);           # total of this combination
+	$gap = int($total - $target);  # gap between that and the target
+	if (abs($gap) < $best) {       # is it the best so far?
+		@out1 = @$c;
+		$best = abs($gap);
+		print qq[best so far $best\n];
+		last if $best == 0;
+	}
+}
+
+# get the other subset
+$string = '!' . join('!', @in) . '!';   # make the imput set into a string like !11!22!33!
+for $i (@out1) {
+	$string =~ s/!$i!/!/;   # remove each one which is in the fist subset
+}
+@out2 = split /!/, substr($string, 1);   # split the string back into an array
+
+# print the results
+print qq[
+Input:        Set = (] . join(', ', @in) . qq[) sum ] . total(@in) . qq[
+Output:  Subset 1 = (] . join(', ', @out1) . qq[) sum ] . total(@out1) . qq[
+         Subset 2 = (] . join(', ', @out2) . qq[) sum ] . total(@out2) . qq[
+];
+
+sub total {    # total(@x) returns sum of all the elements
+	
+	my ($i, $sum);
+	for $i (@_) { $sum += $i; }
+	return $sum;
+
+}
-- 
cgit 


From 039ce95edbe4204dc17654a64c770869a1a338a9 Mon Sep 17 00:00:00 2001
From: Peter Campbell Smith <pj.campbell.smith@gmail.com>
Date: Mon, 2 Aug 2021 17:24:45 +0100
Subject: Solution to challenge 124

---
 challenge-124/peter-campbell-smith/README       |  1 +
 challenge-124/peter-campbell-smith/perl/ch-2.pl | 71 +++++++++++++++++++++++++
 2 files changed, 72 insertions(+)
 create mode 100644 challenge-124/peter-campbell-smith/README
 create mode 100755 challenge-124/peter-campbell-smith/perl/ch-2.pl

diff --git a/challenge-124/peter-campbell-smith/README b/challenge-124/peter-campbell-smith/README
new file mode 100644
index 0000000000..83f9d790e0
--- /dev/null
+++ b/challenge-124/peter-campbell-smith/README
@@ -0,0 +1 @@
+Solution by Peter Campbell Smith
diff --git a/challenge-124/peter-campbell-smith/perl/ch-2.pl b/challenge-124/peter-campbell-smith/perl/ch-2.pl
new file mode 100755
index 0000000000..247e04a2f6
--- /dev/null
+++ b/challenge-124/peter-campbell-smith/perl/ch-2.pl
@@ -0,0 +1,71 @@
+#!/usr/bin/perl
+
+# Peter Campbell Smith : 2021-08-02
+
+use strict;
+use utf8;
+use warnings;
+
+use Algorithm::Combinatorics qw(combinations);
+
+# Required: You are given a set of $n integers (n1, n2, n3, ….).
+
+# Write a script to divide the set in two subsets of n/2 sizes each so that the difference 
+# of the sum of two subsets is the least. If $n is even then each subset must be of size $n/2
+# each. In case $n is odd then one subset must be ($n-1)/2 and other must be ($n+1)/2.
+
+# Method:
+# The aim is to find a subset of $n/2 (or ($n-1)/2) of the input numbers which sums as close as
+# possible to half the sum of the input set (the 'target'). The remaining subset will then sum to 
+# a value the same distance from the other side of the target.
+
+my (@in, @out1, @out2, $target, $count, $subcount, $best, $set, $c, $total, $gap, $i, $string);
+
+# input set - uncomment one of these
+# @in = (10, 20, 30, 40, 50, 60, 70, 80, 90, 100);   # example 1 given in challenge
+# @in = (10, -15, 20, 30, -25, 0, 5, 40, -5);
+# @in = (18, 25, 7, 39, 11, 17, 22, 1 ,41, 19, -5);
+@in = (23, 67, 43, 96, 23, 14, 85, -300, 43, 20, 87, 99, 0, 35, 21, 77, 88, 77, 54, 70, 34, 56, 500);
+
+# some useful numbers
+$target = total(@in) / 2;   	# target value for each subset to add up to (half the total of the input numbers)
+$count = scalar @in;        	# number of numbers
+$subcount = int($count / 2);  	# number in each (or the smaller) subset
+
+# look for subset that is closest to the target
+$best = 1e10;   	# the closest gap found so far between the chosen combination and the target.
+
+# iterate over all possible combinations of the first $subcount numbers
+$set = combinations(\@in, $subcount);   
+while ($c = $set->next) {
+    $total = total(@$c);           # total of this combination
+	$gap = int($total - $target);  # gap between that and the target
+	if (abs($gap) < $best) {       # is it the best so far?
+		@out1 = @$c;
+		$best = abs($gap);
+		print qq[best so far $best\n];
+		last if $best == 0;
+	}
+}
+
+# get the other subset
+$string = '!' . join('!', @in) . '!';   # make the imput set into a string like !11!22!33!
+for $i (@out1) {
+	$string =~ s/!$i!/!/;   # remove each one which is in the fist subset
+}
+@out2 = split /!/, substr($string, 1);   # split the string back into an array
+
+# print the results
+print qq[
+Input:        Set = (] . join(', ', @in) . qq[) sum ] . total(@in) . qq[
+Output:  Subset 1 = (] . join(', ', @out1) . qq[) sum ] . total(@out1) . qq[
+         Subset 2 = (] . join(', ', @out2) . qq[) sum ] . total(@out2) . qq[
+];
+
+sub total {    # total(@x) returns sum of all the elements
+	
+	my ($i, $sum);
+	for $i (@_) { $sum += $i; }
+	return $sum;
+
+}
-- 
cgit 


From 3d2c0bd460eb1bdc13a935014f09dddfd3be036c Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Mon, 2 Aug 2021 15:16:55 +0200
Subject: Solutions in 29 languages for week 124, part 1.

---
 challenge-124/abigail/README.md            | 20 ++++++++++
 challenge-124/abigail/awk/ch-1.awk         | 29 ++++++++++++++
 challenge-124/abigail/bash/ch-1.sh         | 27 +++++++++++++
 challenge-124/abigail/basic/ch-1.bas       | 25 ++++++++++++
 challenge-124/abigail/bc/ch-1.bc           | 26 ++++++++++++
 challenge-124/abigail/befunge-93/ch-1.bf93 | 18 +++++++++
 challenge-124/abigail/c/ch-1.c             | 32 +++++++++++++++
 challenge-124/abigail/cobol/ch-1.cb        | 30 ++++++++++++++
 challenge-124/abigail/csh/ch-1.csh         | 27 +++++++++++++
 challenge-124/abigail/erlang/ch-1.erl      | 31 +++++++++++++++
 challenge-124/abigail/forth/ch-1.fs        | 21 ++++++++++
 challenge-124/abigail/fortran/ch-1.f90     | 28 +++++++++++++
 challenge-124/abigail/go/ch-1.go           | 31 +++++++++++++++
 challenge-124/abigail/java/ch-1.java       | 29 ++++++++++++++
 challenge-124/abigail/lua/ch-1.lua         | 27 +++++++++++++
 challenge-124/abigail/m4/ch-1.m4           | 17 ++++++++
 challenge-124/abigail/mmix/ch-1.mms        | 64 ++++++++++++++++++++++++++++++
 challenge-124/abigail/node/ch-1.js         | 27 +++++++++++++
 challenge-124/abigail/ocaml/ch-1.ml        | 25 ++++++++++++
 challenge-124/abigail/pascal/ch-1.p        | 29 ++++++++++++++
 challenge-124/abigail/perl/ch-1.pl         | 29 ++++++++++++++
 challenge-124/abigail/php/ch-1.php         | 27 +++++++++++++
 challenge-124/abigail/postscript/ch-1.ps   | 26 ++++++++++++
 challenge-124/abigail/python/ch-1.py       | 27 +++++++++++++
 challenge-124/abigail/r/ch-1.r             | 25 ++++++++++++
 challenge-124/abigail/rexx/ch-1.rexx       | 25 ++++++++++++
 challenge-124/abigail/ruby/ch-1.rb         | 27 +++++++++++++
 challenge-124/abigail/scheme/ch-1.scm      | 25 ++++++++++++
 challenge-124/abigail/sql/ch-1.sql         | 25 ++++++++++++
 challenge-124/abigail/tcl/ch-1.tcl         | 25 ++++++++++++
 30 files changed, 824 insertions(+)
 create mode 100644 challenge-124/abigail/awk/ch-1.awk
 create mode 100644 challenge-124/abigail/bash/ch-1.sh
 create mode 100644 challenge-124/abigail/basic/ch-1.bas
 create mode 100644 challenge-124/abigail/bc/ch-1.bc
 create mode 100644 challenge-124/abigail/befunge-93/ch-1.bf93
 create mode 100644 challenge-124/abigail/c/ch-1.c
 create mode 100644 challenge-124/abigail/cobol/ch-1.cb
 create mode 100644 challenge-124/abigail/csh/ch-1.csh
 create mode 100644 challenge-124/abigail/erlang/ch-1.erl
 create mode 100644 challenge-124/abigail/forth/ch-1.fs
 create mode 100644 challenge-124/abigail/fortran/ch-1.f90
 create mode 100644 challenge-124/abigail/go/ch-1.go
 create mode 100644 challenge-124/abigail/java/ch-1.java
 create mode 100644 challenge-124/abigail/lua/ch-1.lua
 create mode 100644 challenge-124/abigail/m4/ch-1.m4
 create mode 100644 challenge-124/abigail/mmix/ch-1.mms
 create mode 100644 challenge-124/abigail/node/ch-1.js
 create mode 100644 challenge-124/abigail/ocaml/ch-1.ml
 create mode 100644 challenge-124/abigail/pascal/ch-1.p
 create mode 100644 challenge-124/abigail/perl/ch-1.pl
 create mode 100644 challenge-124/abigail/php/ch-1.php
 create mode 100644 challenge-124/abigail/postscript/ch-1.ps
 create mode 100644 challenge-124/abigail/python/ch-1.py
 create mode 100644 challenge-124/abigail/r/ch-1.r
 create mode 100644 challenge-124/abigail/rexx/ch-1.rexx
 create mode 100644 challenge-124/abigail/ruby/ch-1.rb
 create mode 100644 challenge-124/abigail/scheme/ch-1.scm
 create mode 100644 challenge-124/abigail/sql/ch-1.sql
 create mode 100644 challenge-124/abigail/tcl/ch-1.tcl

diff --git a/challenge-124/abigail/README.md b/challenge-124/abigail/README.md
index 96ce515677..0bd71c5813 100644
--- a/challenge-124/abigail/README.md
+++ b/challenge-124/abigail/README.md
@@ -27,13 +27,33 @@
 ### Solutions
 * [AWK](awk/ch-1.awk)
 * [Bash](bash/ch-1.sh)
+* [Basic](basic/ch-1.bas)
+* [bc](bc/ch-1.bc)
+* [Befunge-93](befunge-93/ch-1.bf93)
 * [C](c/ch-1.c)
+* [Cobol](cobol/ch-1.cb)
+* [Csh](csh/ch-1.csh)
+* [Erlang](erlang/ch-1.erl)
+* [Forth](forth/ch-1.fs)
+* [Fortran](fortran/ch-1.f90)
+* [Go](go/ch-1.go)
+* [Java](java/ch-1.java)
 * [Lua](lua/ch-1.lua)
+* [m4](m4/ch-1.m4)
+* [MMIX](mmix/ch-1.mms)
 * [Node.js](node/ch-1.js)
+* [Ocaml](ocaml/ch-1.ml)
+* [Pascal](pascal/ch-1.p)
 * [Perl](perl/ch-1.pl)
+* [Php](php/ch-1.php)
+* [Postscript](postscript/ch-1.ps)
 * [Python](python/ch-1.py)
 * [R](r/ch-1.r)
+* [Rexx](rexx/ch-1.rexx)
 * [Ruby](ruby/ch-1.rb)
+* [Scheme](scheme/ch-1.scm)
+* [SQL](sql/ch-1.sql)
+* [Tcl](tcl/ch-1.tcl)
 
 ### Blog
 [Perl Weekly Challenge 124: Happy Women Day][blog1]
diff --git a/challenge-124/abigail/awk/ch-1.awk b/challenge-124/abigail/awk/ch-1.awk
new file mode 100644
index 0000000000..90d459b0d4
--- /dev/null
+++ b/challenge-124/abigail/awk/ch-1.awk
@@ -0,0 +1,29 @@
+#!/usr/bin/awk
+
+#
+# See ../README.md
+#
+
+#
+# Run as: awk -f ch-1.awk
+#
+
+BEGIN {
+    print "    ^^^^^"
+    print "   ^     ^"
+    print "  ^       ^"
+    print " ^         ^"
+    print " ^         ^"
+    print " ^         ^"
+    print " ^         ^"
+    print " ^         ^"
+    print "  ^       ^"
+    print "   ^     ^"
+    print "    ^^^^^"
+    print "      ^"
+    print "      ^"
+    print "      ^"
+    print "    ^^^^^"
+    print "      ^"
+    print "      ^"
+}
\ No newline at end of file
diff --git a/challenge-124/abigail/bash/ch-1.sh b/challenge-124/abigail/bash/ch-1.sh
new file mode 100644
index 0000000000..683a1ac0f1
--- /dev/null
+++ b/challenge-124/abigail/bash/ch-1.sh
@@ -0,0 +1,27 @@
+#!/bin/sh
+
+#
+# See ../README.md
+#
+
+#
+# Run as: bash ch-1.sh
+#
+
+echo "    ^^^^^"
+echo "   ^     ^"
+echo "  ^       ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo "  ^       ^"
+echo "   ^     ^"
+echo "    ^^^^^"
+echo "      ^"
+echo "      ^"
+echo "      ^"
+echo "    ^^^^^"
+echo "      ^"
+echo "      ^"
\ No newline at end of file
diff --git a/challenge-124/abigail/basic/ch-1.bas b/challenge-124/abigail/basic/ch-1.bas
new file mode 100644
index 0000000000..eee344ff4b
--- /dev/null
+++ b/challenge-124/abigail/basic/ch-1.bas
@@ -0,0 +1,25 @@
+010 REM 
+020 REM See ../README.md
+030 REM 
+
+040 REM 
+050 REM Run as: basic ch-1.bas
+060 REM 
+
+100 PRINT "    ^^^^^"
+101 PRINT "   ^     ^"
+102 PRINT "  ^       ^"
+103 PRINT " ^         ^"
+104 PRINT " ^         ^"
+105 PRINT " ^         ^"
+106 PRINT " ^         ^"
+107 PRINT " ^         ^"
+108 PRINT "  ^       ^"
+109 PRINT "   ^     ^"
+110 PRINT "    ^^^^^"
+111 PRINT "      ^"
+112 PRINT "      ^"
+113 PRINT "      ^"
+114 PRINT "    ^^^^^"
+115 PRINT "      ^"
+116 PRINT "      ^"
\ No newline at end of file
diff --git a/challenge-124/abigail/bc/ch-1.bc b/challenge-124/abigail/bc/ch-1.bc
new file mode 100644
index 0000000000..7f41441d7f
--- /dev/null
+++ b/challenge-124/abigail/bc/ch-1.bc
@@ -0,0 +1,26 @@
+#
+# See ../README.md
+#
+
+#
+# Run as: bc ch-1.bc
+#
+"    ^^^^^
+   ^     ^
+  ^       ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+ ^         ^
+  ^       ^
+   ^     ^
+    ^^^^^
+      ^
+      ^
+      ^
+    ^^^^^
+      ^
+      ^
+"
+quit
\ No newline at end of file
diff --git a/challenge-124/abigail/befunge-93/ch-1.bf93 b/challenge-124/abigail/befunge-93/ch-1.bf93
new file mode 100644
index 0000000000..f5bd23acb2
--- /dev/null
+++ b/challenge-124/abigail/befunge-93/ch-1.bf93
@@ -0,0 +1,18 @@
+55+      "^      "                v
+55+      "^      "               v>
+55+    "^^^^^    "              v>
+55+      "^      "             v>
+55+      "^      "            v>
+55+      "^      "           v>
+55+    "^^^^^    "          v>
+55+   "^     ^   "         v>
+55+  "^       ^  "        v>
+55+ "^         ^ "       v>
+55+ "^         ^ "      v>
+55+ "^         ^ "     v>
+55+ "^         ^ "    v>
+55+ "^         ^ "   v>
+55+  "^       ^  "  v>
+55+   "^     ^   " v>
+55+    "^^^^^    "v>
+             ,_@#:<
diff --git a/challenge-124/abigail/c/ch-1.c b/challenge-124/abigail/c/ch-1.c
new file mode 100644
index 0000000000..c04528cd88
--- /dev/null
+++ b/challenge-124/abigail/c/ch-1.c
@@ -0,0 +1,32 @@
+# 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 ("    ^^^^^\n");
+    printf ("   ^     ^\n");
+    printf ("  ^       ^\n");
+    printf (" ^         ^\n");
+    printf (" ^         ^\n");
+    printf (" ^         ^\n");
+    printf (" ^         ^\n");
+    printf (" ^         ^\n");
+    printf ("  ^       ^\n");
+    printf ("   ^     ^\n");
+    printf ("    ^^^^^\n");
+    printf ("      ^\n");
+    printf ("      ^\n");
+    printf ("      ^\n");
+    printf ("    ^^^^^\n");
+    printf ("      ^\n");
+    printf ("      ^\n");
+    exit (0);
+}
\ No newline at end of file
diff --git a/challenge-124/abigail/cobol/ch-1.cb b/challenge-124/abigail/cobol/ch-1.cb
new file mode 100644
index 0000000000..6e665d4ce4
--- /dev/null
+++ b/challenge-124/abigail/cobol/ch-1.cb
@@ -0,0 +1,30 @@
+IDENTIFICATION DIVISION.
+PROGRAM-ID. VENUS.
+
+*>
+*> See ../README.md
+*>
+
+*>
+*> Run as: cobc -xF ch-1.cb; ./ch-1
+*>
+
+PROCEDURE DIVISION.
+    DISPLAY "    ^^^^^".
+    DISPLAY "   ^     ^".
+    DISPLAY "  ^       ^".
+    DISPLAY " ^         ^".
+    DISPLAY " ^         ^".
+    DISPLAY " ^         ^".
+    DISPLAY " ^         ^".
+    DISPLAY " ^         ^".
+    DISPLAY "  ^       ^".
+    DISPLAY "   ^     ^".
+    DISPLAY "    ^^^^^".
+    DISPLAY "      ^".
+    DISPLAY "      ^".
+    DISPLAY "      ^".
+    DISPLAY "    ^^^^^".
+    DISPLAY "      ^".
+    DISPLAY "      ^".
+    STOP RUN.
diff --git a/challenge-124/abigail/csh/ch-1.csh b/challenge-124/abigail/csh/ch-1.csh
new file mode 100644
index 0000000000..453a03b2f7
--- /dev/null
+++ b/challenge-124/abigail/csh/ch-1.csh
@@ -0,0 +1,27 @@
+#!/bin/csh
+
+#
+# See ../README.md
+#
+
+#
+# Run as: csh ch-1.csh
+#
+
+echo "    ^^^^^"
+echo "   ^     ^"
+echo "  ^       ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo " ^         ^"
+echo "  ^       ^"
+echo "   ^     ^"
+echo "    ^^^^^"
+echo "      ^"
+echo "      ^"
+echo "      ^"
+echo "    ^^^^^"
+echo "      ^"
+echo "      ^"
\ No newline at end of file
diff --git a/challenge-124/abigail/erlang/ch-1.erl b/challenge-124/abigail/erlang/ch-1.erl
new file mode 100644
index 0000000000..0b12117541
--- /dev/null
+++ b/challenge-124/abigail/erlang/ch-1.erl
@@ -0,0 +1,31 @@
+%
+% See ../README.md
+%
+
+%
+% Run as: ln ch-1.erl ch1.erl
+%         erl -compile ch1
+%         erl -noshell -s ch1 main -s init stop
+%
+
+-module (ch1).
+-export ([main/0]).
+
+main () ->
+    io:fwrite ("    ^^^^^\n"),
+    io:fwrite ("   ^     ^\n"),
+    io:fwrite ("  ^       ^\n"),
+    io:fwrite (" ^         ^\n"),
+    io:fwrite (" ^         ^\n"),
+    io:fwrite (" ^         ^\n"),
+    io:fwrite (" ^         ^\n"),
+    io:fwrite (" ^         ^\n"),
+    io:fwrite ("  ^       ^\n"),
+    io:fwrite ("   ^     ^\n"),
+    io:fwrite ("    ^^^^^\n"),
+    io:fwrite ("      ^\n"),
+    io:fwrite ("      ^\n"),
+    io:fwrite ("      ^\n"),
+    io:fwrite ("    ^^^^^\n"),
+    io:fwrite ("      ^\n"),
+    io:fwrite ("      ^\n").
\ No newline at end of file
diff --git a/challenge-124/abigail/forth/ch-1.fs b/challenge-124/abigail/forth/ch-1.fs
new file mode 100644
index 0000000000..b7bdbafc7f
--- /dev/null
+++ b/challenge-124/abigail/forth/ch-1.fs
@@ -0,0 +1,21 @@
+\
+\ See ../README.md
+\
+
+.(     ^^^^^)
+.(    ^     ^)
+.(   ^       ^)
+.(  ^         ^)
+.(  ^         ^)
+.(  ^         ^)
+.(  ^         ^)
+.(  ^         ^)
+.(   ^       ^)
+.(    ^     ^)
+.(     ^^^^^)
+.(       ^)
+.(       ^)
+.(       ^)
+.(     ^^^^^)
+.(       ^)
+.(       ^)
\ No newline at end of file
diff --git a/challenge-124/abigail/fortran/ch-1.f90 b/challenge-124/abigail/fortran/ch-1.f90
new file mode 100644
index 0000000000..52f8dead50
--- /dev/null
+++ b/challenge-124/abigail/fortran/ch-1.f90
@@ -0,0 +1,28 @@
+!
+! See ../README.md
+!
+
+!
+! Run as: gfortran -o ch-1.o ch-1.f90; ./ch-1.o
+!
+
+program ch1
+    implicit none
+    write (*, *) "   ^^^^^"
+    write (*, *) "  ^     ^"
+    write (*, *) " ^       ^"
+    write (*, *) "^         ^"
+    write (*, *) "^         ^"
+    write (*, *) "^         ^"
+    write (*, *) "^         ^"
+    write (*, *) "^         ^"
+    write (*, *) " ^       ^"
+    write (*, *) "  ^     ^"
+    write (*, *) "   ^^^^^"
+    write (*, *) "     ^"
+    write (*, *) "     ^"
+    write (*, *) "     ^"
+    write (*, *) "   ^^^^^"
+    write (*, *) "     ^"
+    write (*, *) "     ^"
+end
\ No newline at end of file
diff --git a/challenge-124/abigail/go/ch-1.go b/challenge-124/abigail/go/ch-1.go
new file mode 100644
index 0000000000..d7ccf33b7a
--- /dev/null
+++ b/challenge-124/abigail/go/ch-1.go
@@ -0,0 +1,31 @@
+package main
+
+//
+// See ../README.md
+//
+
+//
+// Run as: go run ch-1.go
+//
+
+import "fmt"
+
+func main () {
+    fmt . Print ("    ^^^^^\n")
+    fmt . Print ("   ^     ^\n")
+    fmt . Print ("  ^       ^\n")
+    fmt . Print (" ^         ^\n")
+    fmt . Print (" ^         ^\n")
+    fmt . Print ("