From 3b33fea6b629ea70479ed7188a86987cfa6d7b1e Mon Sep 17 00:00:00 2001
From: Luis Mochan <mochan@fis.unam.mx>
Date: Sun, 20 Nov 2022 13:20:14 -0600
Subject: Correct small mistake

---
 challenge-191/wlmb/perl/ch-2d.pl | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/challenge-191/wlmb/perl/ch-2d.pl b/challenge-191/wlmb/perl/ch-2d.pl
index 440b19dcfc..640ed3cc59 100755
--- a/challenge-191/wlmb/perl/ch-2d.pl
+++ b/challenge-191/wlmb/perl/ch-2d.pl
@@ -34,7 +34,7 @@ sub cute($n){ # return an iterator to generate all cute sequences of length $n
                         return([$candidate, @$cute], {$candidate, 1, %$seen})
 	                    unless $seen->{$candidate};
                     }
-                    return () unless ($cute, $seen)=$it->(); # next subsequence or return
+                    ($cute, $seen)=$it->() or return (); # next subsequence or return
                     $candidates=listit(@set); # reinitalize iterator for candidates
                }
             }
@@ -46,7 +46,7 @@ die << "EOF" unless @ARGV;
 Usage: $0 N1 [N2...]
 to count the cute orderings of 1..Ni
 EOF
-warn "Numbers beyond 20 will require patience" unless all {1<=$_<=18} @ARGV;
+warn "Numbers beyond 20 will require patience" unless all {1<=$_<=20} @ARGV;
 for(@ARGV){
     my $count=0;
     my $it=cute($_);
-- 
cgit