From 511f82b397acb52cc795b8be8be4c317bcc700fe Mon Sep 17 00:00:00 2001
From: E7-87-83 <fungcheokyin@gmail.com>
Date: Sun, 20 Mar 2022 14:40:21 +0800
Subject: fix everywhere

---
 challenge-156/cheok-yin-fung/perl/ch-1.pl | 10 +++++++---
 challenge-156/cheok-yin-fung/perl/ch-2.pl |  2 +-
 2 files changed, 8 insertions(+), 4 deletions(-)

diff --git a/challenge-156/cheok-yin-fung/perl/ch-1.pl b/challenge-156/cheok-yin-fung/perl/ch-1.pl
index bbf0bbfbf8..24941c76d7 100644
--- a/challenge-156/cheok-yin-fung/perl/ch-1.pl
+++ b/challenge-156/cheok-yin-fung/perl/ch-1.pl
@@ -1,4 +1,8 @@
 #!/usr/bin/perl
+# The Weekly Challenge 156
+# Task 1 Pernicious Number
+# Usage: 
+# ch-1.pl [$N, for an output with the first $N pernicious number]
 use v5.22.0;
 use warnings;
 use Math::Prime::Util qw /next_prime/;
@@ -14,15 +18,15 @@ my @pern_num = ();
 for my $k (2..$ub) {
     my $prime = 2;
     while ($prime <= $k) {
-        my @weight_k_pern_num = ();
+        my @length_k_weight_p_num = ();
         my $iter = combinations([1..$k-1], $prime-1);
         while (my $c = $iter->next) {
             my @ch = ((1), (0) x ($k-1));
             $ch[$_] = 1 for @{$c};
             my $new_pern_num = oct("0b".(join "", @ch));
-            push @weight_k_pern_num, $new_pern_num;
+            push @length_k_weight_p_num, $new_pern_num;
         }
-        push @pern_num, @weight_k_pern_num;
+        push @pern_num, @length_k_weight_p_num;
         $prime = next_prime($prime);
     }
     last if scalar @pern_num >= $N;
diff --git a/challenge-156/cheok-yin-fung/perl/ch-2.pl b/challenge-156/cheok-yin-fung/perl/ch-2.pl
index 7dccf5706e..364e15a9c9 100644
--- a/challenge-156/cheok-yin-fung/perl/ch-2.pl
+++ b/challenge-156/cheok-yin-fung/perl/ch-2.pl
@@ -1,7 +1,7 @@
 #!/usr/bin/perl
 # The Weekly Challenge 156
 # Task 2 Weird Number 
-# references:
+# references on subset sum:
 # https://www.geeksforgeeks.org/subset-sum-problem-dp-25/
 # Usage: $ ch-2.pl $N
 
-- 
cgit