From d8bf13e8b3b4cbc1bcc60ccd35029744265ac283 Mon Sep 17 00:00:00 2001
From: E7-87-83 <fungcheokyin@gmail.com>
Date: Sun, 20 Dec 2020 22:51:55 +0800
Subject: Challenge 091

---
 challenge-091/cheok-yin-fung/perl/ch-1.pl | 54 +++++++++++++++++++++++++++++++
 challenge-091/cheok-yin-fung/perl/ch-2.pl | 33 +++++++++++++++++++
 2 files changed, 87 insertions(+)
 create mode 100644 challenge-091/cheok-yin-fung/perl/ch-1.pl
 create mode 100644 challenge-091/cheok-yin-fung/perl/ch-2.pl

(limited to 'challenge-091')

diff --git a/challenge-091/cheok-yin-fung/perl/ch-1.pl b/challenge-091/cheok-yin-fung/perl/ch-1.pl
new file mode 100644
index 0000000000..c29e011b79
--- /dev/null
+++ b/challenge-091/cheok-yin-fung/perl/ch-1.pl
@@ -0,0 +1,54 @@
+#!/usr/bin/perl
+# The Weekly Challenge - Perl & Raku - 090
+# Task 1: Count Number
+# Usage: ch-1.pl $N
+
+use strict;
+use warnings;
+#use Test::More tests => 3;
+
+my $N = $ARGV[0] ? $ARGV[0] : 1048576 ;
+my @NAME = qw/zero one two three four five six seven eight nine/;
+
+sub newnumber {
+    my $n = $_[0];
+    my @digit = ((split "", $n), "E");
+    my @segment = ();
+    my @d_segment = ();
+
+    my $k = 0;
+    while ($k <= (length $n) - 1) {
+        my $r = 1;
+        while ($digit[$k] eq $digit[$k+1]) { 
+            $r++;
+            $k++;
+        }
+        die "I cannot say it." if $r > 9;
+        push @segment, $r;
+        push @d_segment, $digit[$k];
+        $k++;
+    }
+
+
+    my $ans;
+    for (0..$#segment) {
+        $ans .= $segment[$_].$d_segment[$_];
+    }
+
+    my @d_ans = split "", $ans;
+    my $outp = "";
+    for (my $i = 0; $i < length $ans; $i=$i+2) {
+        $outp .= $NAME[$d_ans[$i]]." ".$d_ans[$i+1];
+        if ($i == (length $ans) - 2) {$outp .= ".\n"} else {$outp .= ", "}
+    }
+    return [$ans, $outp];
+}
+unless ($ARGV[0]) {print "input: ", 1048576 , "\n"}
+print "output: ", newnumber($N)->[0], "\n";
+print newnumber($N)->[1], "\n";
+
+=pod
+ok( newnumber(1122234)->[0] == 21321314 , "Example 1");
+ok( newnumber(2333445)->[0] == 12332415 , "Example 2");
+ok( newnumber(12345)->[0] == 1112131415 , "Example 3");
+=cut
diff --git a/challenge-091/cheok-yin-fung/perl/ch-2.pl b/challenge-091/cheok-yin-fung/perl/ch-2.pl
new file mode 100644
index 0000000000..380b005abe
--- /dev/null
+++ b/challenge-091/cheok-yin-fung/perl/ch-2.pl
@@ -0,0 +1,33 @@
+#!/usr/bin/perl
+# The Weekly Challenge 091
+# Task 2 Jump Game
+use strict;
+use warnings;
+
+my @N = @ARGV;
+@N = (2,1,2,0,2) if !$ARGV[0];
+
+sub backtrack {
+    my @arr = @_;
+    my $position = $#arr;
+    while ($position > 0) {
+        my $index = $position - 1;
+        while ($index >= 0) {
+            if ($arr[$index] >= $position-$index) {
+                $position = $index;
+                last;
+            } else {
+                $index--;
+            }
+        }
+        if ($index < 0) {last;}
+    }
+
+    return ($position == 0 ? 1 : 0);                
+}   
+
+print join ",", @N;
+print "\n";
+print backtrack(@N), "\n";
+
+
-- 
cgit