From 7c079f5277c5bfa4a2938707739dc6b205089105 Mon Sep 17 00:00:00 2001
From: E7-87-83 <fungcheokyin@gmail.com>
Date: Sun, 25 Aug 2024 20:02:59 +0800
Subject: Week 283

---
 challenge-283/cheok-yin-fung/perl/ch-1.pl | 17 ++++++++
 challenge-283/cheok-yin-fung/perl/ch-2.pl | 72 +++++++++++++++++++++++++++++++
 2 files changed, 89 insertions(+)
 create mode 100644 challenge-283/cheok-yin-fung/perl/ch-1.pl
 create mode 100644 challenge-283/cheok-yin-fung/perl/ch-2.pl

diff --git a/challenge-283/cheok-yin-fung/perl/ch-1.pl b/challenge-283/cheok-yin-fung/perl/ch-1.pl
new file mode 100644
index 0000000000..98342afe84
--- /dev/null
+++ b/challenge-283/cheok-yin-fung/perl/ch-1.pl
@@ -0,0 +1,17 @@
+# The Weekly Challenge 283
+# Task 1 Unique Number
+
+use v5.30;
+use warnings;
+use List::MoreUtils qw/singleton/;
+
+sub un {
+    my @ints = @_;
+    return (singleton @ints)[0];
+}
+
+use Test::More tests=>4;
+ok un(3,3,1) == 1;
+ok un(3,2,4,2,4) == 3;
+ok un(1) == 1;
+ok un(4,3,1,1,1,4) == 3;
diff --git a/challenge-283/cheok-yin-fung/perl/ch-2.pl b/challenge-283/cheok-yin-fung/perl/ch-2.pl
new file mode 100644
index 0000000000..4af869778b
--- /dev/null
+++ b/challenge-283/cheok-yin-fung/perl/ch-2.pl
@@ -0,0 +1,72 @@
+# The Weekly Challenge 283
+# Task 2 Digit Count Value
+
+use v5.30;
+use warnings;
+use Integer::Partition;
+use List::Util qw/sum any all/;
+use List::MoreUtils qw/occurrences/;
+
+# The required subroutine is verify or verify_mechanical.
+# It is shown that only 7 arrays satisfying the requirement 
+#     from array size = 2 to 10.
+# They are:
+# 2020
+# 1210
+# 21200
+# 3211000
+# 42101000
+# 521001000
+# 6210001000
+
+sub verify {
+    my @x = @_;
+    my $n = $#x+1;
+    my @o = occurrences @x;
+    my $bool = 1;
+    for my $i (0..$#x) {
+        $bool = 0 unless $x[$i]==0 || any {$_ == $i} $o[$x[$i]]->@*;
+        last unless $bool;
+    }
+    return $bool;
+}
+
+sub verify_mechanical {
+    my @x = @_;
+    my %y;
+    for my $i (0..$#x) {
+        $y{$i}=0;
+    }
+    for my $i (0..$#x) {
+        $y{$x[$i]}++;
+    }
+    return all {$y{$_} == $x[$_]} 0..$#x;
+}
+
+my @arr;
+for my $n (2..10) {
+    my $y = Integer::Partition->new($n);
+    my $p = $y->next; # skip the first partition (trivial one-portion partition)
+    while ($p = $y->next) {
+        my @x = (0) x $n;
+        my @o = occurrences @$p;
+        for my $i (1..$#o) {
+            for my $k ($o[$i]->@*) {
+                $x[$k] = $i;
+            }
+        }
+        for my $k (1..$#x) {
+            $x[0]++ if $x[$k] == 0;
+        }    
+        push @arr,[@x] if verify(@x);
+    }
+}
+
+use Data::Printer;
+p @arr;
+
+use Test::More tests=>4;
+ok verify(1,2,1,0);
+ok !verify(0,3,0);
+ok verify_mechanical(1,2,1,0);
+ok !verify_mechanical(0,3,0);
-- 
cgit