Merge pull request #7461 from wlmb/challenges

Solve PWC 201

Author: manwar

challenge-201/wlmb/blog.txt

@@ -0,0 +1,2 @@
+https://wlmb.github.io/2023/01/23/PWC201/
+

challenge-201/wlmb/perl/ch-1.pl

@@ -0,0 +1,14 @@
+#!/usr/bin/env perl
+# Perl weekly challenge 201
+# Task 1:  Missing Numbers
+#
+# See https://wlmb.github.io/2023/01/23/PWC201/#task-1-missing-numbers
+use v5.36;
+my %seen;
+die <<~ "FIN" unless @ARGV;
+    Usage: $0 N1 [N2...]
+    to find the missing numbers from the sequence N1 N2...
+    FIN
+@seen{@ARGV}=(1)x@ARGV;
+die "Expected unique values" unless 0+@ARGV==0+keys %seen;
+say join " ", @ARGV, "->", grep {!$seen{$_}} 0..@ARGV;

challenge-201/wlmb/perl/ch-2.pl

@@ -0,0 +1,18 @@
+#!/usr/bin/env perl
+# Perl weekly challenge 201
+# Task 2:  Penny Piles
+#
+# See https://wlmb.github.io/2023/01/23/PWC201/#task-2-penny-piles
+use v5.36;
+use List::Util qw(min sum);
+use Memoize;
+memoize "rows";
+die <<~"FIN" unless @ARGV;
+    Usage: $0 N1 [N2...]
+    to obtain the number of ascending rows of piles of Ni coins.
+    FIN
+say "$_->", rows($_, $_) for @ARGV;
+sub rows($coins,$max){
+    return 1 if $coins==0;
+    return sum map{rows($coins-$_,min($_, $coins-$_))} 1..min($coins, $max)
+}