- Added solutions by Laurent Rosenfeld.

3 files changed, 35 insertions, 0 deletions

diff --git a/challenge-243/laurent-rosenfeld/blog.txt b/challenge-243/laurent-rosenfeld/blog.txt
new file mode 100644
index 0000000000..6c87af76ea
--- /dev/null
+++ b/challenge-243/laurent-rosenfeld/blog.txt
@@ -0,0 +1 @@
+https://blogs.perl.org/users/laurent_r/2023/11/perl-weekly-challenge-243-reverse-pairs.html
diff --git a/challenge-243/laurent-rosenfeld/perl/ch-1.pl b/challenge-243/laurent-rosenfeld/perl/ch-1.pl
new file mode 100644
index 0000000000..3c89cb687c
--- /dev/null
+++ b/challenge-243/laurent-rosenfeld/perl/ch-1.pl
@@ -0,0 +1,20 @@
+use strict;
+use warnings;
+use feature 'say';
+
+sub count_reverse_pairs {
+    my @in = @_;
+    my $end = $#in;
+    my $count = 0;
+    for my $i (0..$end-1) {
+        for my $j ($i..$end) {
+            $count++ if $in[$i] > 2 * $in[$j];
+        }
+    }
+    return $count;
+}
+
+for my $test ([qw<1 3 2 3 1>], [qw<2 4 3 5 1>]) {
+    print "@$test => ";
+    say count_reverse_pairs @$test;
+}
diff --git a/challenge-243/laurent-rosenfeld/raku/ch-1.raku b/challenge-243/laurent-rosenfeld/raku/ch-1.raku
new file mode 100644
index 0000000000..2d19c627be
--- /dev/null
+++ b/challenge-243/laurent-rosenfeld/raku/ch-1.raku
@@ -0,0 +1,14 @@
+sub count-reverse-pairs (@in) {
+    my $count = 0;
+    for 0..^@in.end -> $i {
+        for $i+1..@in.end -> $j {
+            $count++ if @in[$i] > 2 * @in[$j];
+        }
+    }
+    return $count;
+}
+
+for <1 3 2 3 1>, <2 4 3 5 1> -> @test {
+    print "@test[] => ";
+    say count-reverse-pairs @test;
+}