perl solution to problem 51-2

1 files changed, 33 insertions, 0 deletions

diff --git a/challenge-051/walt-mankowski/perl/ch-2.pl b/challenge-051/walt-mankowski/perl/ch-2.pl
new file mode 100644
index 0000000000..756b3c2a4c
--- /dev/null
+++ b/challenge-051/walt-mankowski/perl/ch-2.pl
@@ -0,0 +1,33 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+use feature qw(:5.30);
+use experimental qw(signatures);
+use List::Util qw(product);
+
+# Colourful Number
+# Write a script to display all Colorful Number with 3 digits.
+#
+# A number can be declare Colorful Number where all the products of
+# consecutive subsets of digit are different.
+#
+# For example, 263 is a Colorful Number since 2, 6, 3, 2x6, 6x3, 2x6x3 are unique.
+
+sub is_colorful($n) {
+    my %prods;
+    for my $len (1..length($n)) {
+        for my $i (0..length($n) - $len) {
+            my $p = product split //, substr($n, $i, $len);
+            if (defined $prods{$p}) {
+                return 0;
+            } else {
+                $prods{$p} = 1;
+            }
+        }
+    }
+    return 1;
+}
+
+for my $n (100..999) {
+    say $n if is_colorful($n);
+}