blob: 756b3c2a4c922e1635d9db5f1eb6c3ec039e734b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
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);
}
|
