From 3c0ba8d1be2fdf65d6707f9adbbc415952e6ecec Mon Sep 17 00:00:00 2001
From: Mohammad S Anwar <mohammad.anwar@yahoo.com>
Date: Sun, 14 Apr 2019 22:27:47 +0100
Subject: - Updated solution by Mark Senn.

---
 challenge-003/mark-senn/perl6/ch-1.p6 | 20 +++++++++++++++++---
 1 file changed, 17 insertions(+), 3 deletions(-)

diff --git a/challenge-003/mark-senn/perl6/ch-1.p6 b/challenge-003/mark-senn/perl6/ch-1.p6
index ed581f6b18..f900a3c9ac 100644
--- a/challenge-003/mark-senn/perl6/ch-1.p6
+++ b/challenge-003/mark-senn/perl6/ch-1.p6
@@ -8,6 +8,20 @@
 # Run using Perl 6.
 use v6;
 
-my @prime = (2, 3, 5);
-my @product = @prime <<*>> @prime;
-@product.join("\n").say;
+# Maximum exponent.
+my $m = 2;
+
+# Construct the result.
+my @r = ();
+# No need to get fancy---nested loops
+# will produce only the numbers needed.
+for (1..$m) -> $i  {
+    for (1..$m) -> $j  {
+        for (1..$m) -> $k  {
+            @r.push(2**$i * 3**$j * 5**$k);
+        }
+    }
+}
+
+# Print the result.
+@r.sort.join("\n").say;
-- 
cgit