- Added Perl solutions to the "Bit Sum" task.

2 files changed, 84 insertions, 0 deletions

diff --git a/challenge-059/mohammad-anwar/perl/ch-2.pl b/challenge-059/mohammad-anwar/perl/ch-2.pl
new file mode 100644
index 0000000000..534646d355
--- /dev/null
+++ b/challenge-059/mohammad-anwar/perl/ch-2.pl
@@ -0,0 +1,38 @@
+#!/usr/bin/perl
+
+use strict;
+use warnings;
+
+use Algorithm::Combinatorics qw(combinations);
+
+print &s([2, 3, 4]);
+
+sub s {
+    my ($A) = @_;
+
+    my $sum = 0;
+    foreach my $pair (combinations($A, 2)) {
+        $sum += f(@$pair);
+    }
+
+    return $sum;
+}
+
+sub f {
+    my ($a, $b) = @_;
+
+    $a = sprintf("%b", $a);
+    $b = sprintf("%b", $b);
+
+    my $m = length($a) > length($b) ? length($a) : length($b);
+    my $f = '%0'.$m.'d';
+    my @a = split //, sprintf $f, $a;
+    my @b = split //, sprintf $f, $b;
+
+    my $bits = 0;
+    foreach (0..$m-1) {
+        $bits += 1 if ($a[$_] != $b[$_]);
+    }
+
+    return $bits;
+}
diff --git a/challenge-059/mohammad-anwar/perl/ch-2a.pl b/challenge-059/mohammad-anwar/perl/ch-2a.pl
new file mode 100644
index 0000000000..bed6b32f44
--- /dev/null
+++ b/challenge-059/mohammad-anwar/perl/ch-2a.pl
@@ -0,0 +1,46 @@
+#!/usr/bin/perl
+
+use Test::More;
+
+use Algorithm::Combinatorics qw(combinations);
+
+my $unit_tests = [
+    { in => [1, 2, 3], out => 4 },
+    { in => [2, 3, 4], out => 6 },
+];
+
+foreach my $unit_test (@$unit_tests) {
+    is (&s($unit_test->{in}), $unit_test->{out});
+}
+
+done_testing;
+
+sub s {
+    my ($A) = @_;
+
+    my $sum = 0;
+    foreach my $pair (combinations($A, 2)) {
+        $sum += f(@$pair);
+    }
+
+    return $sum;
+}
+
+sub f {
+    my ($a, $b) = @_;
+
+    $a = sprintf("%b", $a);
+    $b = sprintf("%b", $b);
+
+    my $m = length($a) > length($b) ? length($a) : length($b);
+    my $f = '%0'.$m.'d';
+    my @a = split //, sprintf $f, $a;
+    my @b = split //, sprintf $f, $b;
+
+    my $bits = 0;
+    foreach (0..$m-1) {
+        $bits += 1 if ($a[$_] != $b[$_]);
+    }
+
+    return $bits;
+}