Merge pull request #477 from jacoby/master

Week 20

2 files changed, 120 insertions, 0 deletions

diff --git a/challenge-020/dave-jacoby/perl5/ch-1.pl b/challenge-020/dave-jacoby/perl5/ch-1.pl
new file mode 100755
index 0000000000..af335c0fdf
--- /dev/null
+++ b/challenge-020/dave-jacoby/perl5/ch-1.pl
@@ -0,0 +1,41 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+use utf8;
+use feature qw{ fc postderef say signatures state switch };
+no warnings
+    qw{ experimental::postderef experimental::smartmatch experimental::signatures };
+
+if (@ARGV) {
+    for my $string (@ARGV) {
+        say $string;
+        say join ', ', map { qq{"$_"} } split_on_change($string);
+        say '';
+    }
+}
+else {
+    my $string = 'ABBCDEEF';
+    say $string;
+    say join ', ', map { qq{"$_"} } split_on_change($string);
+    say '';
+}
+
+sub split_on_change ( $string ) {
+    my @array;
+    my $cache = '';
+    for my $l ( split //, $string ) {
+        state $m = '';
+        if ( $l eq $m ) {
+            $cache .= $l;
+        }
+        else {
+            $m = $l;
+            push @array, $cache;
+            $cache = $l;
+        }
+    }
+    push @array, $cache;
+    @array = grep { length $_ } @array;
+    return wantarray ? @array : \@array;
+}
diff --git a/challenge-020/dave-jacoby/perl5/ch-2.pl b/challenge-020/dave-jacoby/perl5/ch-2.pl
new file mode 100755
index 0000000000..85eb0e13ab
--- /dev/null
+++ b/challenge-020/dave-jacoby/perl5/ch-2.pl
@@ -0,0 +1,79 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+use utf8;
+use feature qw{ postderef say signatures state switch };
+no warnings
+    qw{ experimental::postderef experimental::smartmatch experimental::signatures };
+
+## Amicable numbers are two different numbers so related
+## that the sum of the proper divisors of each is equal
+## to the other number.
+
+# I admit, I had to look at another implementation (in Python)
+# to understand what is being asked.
+
+# I pulled out my previously-used factor() code, and reverted it back
+# to (1..$n/2) rather than (1..sqrt $n) because of the demonstration
+# in wikipedia gave the longer list.
+
+# sum0 returns a 0 instead of undef if the sum is 0, which doesn't 
+# affect real results but prevents ugly errors in the fail cases
+
+use List::Util qw{sum0};
+use JSON;
+my $json = JSON->new->pretty->canonical;
+
+say join "\n", map { join ', ', $_->@* } amicable_pair(10_000);
+exit;
+
+sub amicable_pair( $n ) {
+    my @result;
+    for my $x ( 1 .. $n ) {
+
+        # $check is a hashref and exists to ensure that we only cover 
+        # every number pair once. 
+        # @pair is assigned by sorted $x ,$y so it contains 220, 284 
+        # and never 284, 220.
+        # $key is @pair joined together, so if "220,284" is covered
+        # we go on.
+
+        # given any number x, y equals the sum of the factors for x.
+        # and here, z equals the sum of the factors of y.
+        # if x == y, that doesn't count, so we take care of that case
+        # before we even start looking at z.
+
+        state $check;
+        my $y = sum_factors($x);
+        next if $x == $y;
+        my @pair = sort $x, $y;
+        my $key  = join ',', @pair;
+        next if $check->{$key}++;
+        my $z = sum_factors($y);
+        if ( $x == $z ) {
+            push @result, \@pair;
+        }
+    }
+    return @result;
+}
+
+sub sum_factors ( $n ) {
+    my @factors = factor($n);
+    return sum0 @factors;
+}
+
+sub factor ( $n ) {
+    my @factors;
+    for my $i ( 1 ..  $n / 2 ) {
+        push @factors, $i if $n % $i == 0;
+    }
+    return @factors;
+}
+
+__DATA__
+220, 284
+1184, 1210
+2620, 2924
+5020, 5564
+6232, 6368