challenge-257

2 files changed, 251 insertions, 0 deletions

diff --git a/challenge-257/peter-meszaros/perl/ch-1.pl b/challenge-257/peter-meszaros/perl/ch-1.pl
new file mode 100755
index 0000000000..ecb19ae32c
--- /dev/null
+++ b/challenge-257/peter-meszaros/perl/ch-1.pl
@@ -0,0 +1,71 @@
+#!/usr/bin/env perl
+#
+# You are given a array of integers, @ints.
+# 
+# Write a script to find out how many integers are smaller than current i.e.
+# foreach ints[i], count ints[j] < ints[i] where i != j.
+# Example 1
+# 
+# Input: @ints = (5, 2, 1, 6)
+# Output: (2, 1, 0, 3)
+# 
+# For $ints[0] = 5, there are two integers (2,1) smaller than 5.
+# For $ints[1] = 2, there is one integer (1) smaller than 2.
+# For $ints[2] = 1, there is none integer smaller than 1.
+# For $ints[3] = 6, there are three integers (5,2,1) smaller than 6.
+# 
+# Example 2
+# 
+# Input: @ints = (1, 2, 0, 3)
+# Output: (1, 2, 0, 3)
+# 
+# Example 3
+# 
+# Input: @ints = (0, 1)
+# Output: (0, 1)
+# 
+# Example 4
+# 
+# Input: @ints = (9, 4, 9, 2)
+# Output: (2, 1, 2, 0)
+# 
+
+use strict;
+use warnings;
+use Test2::V0 -no_srand => 1;
+use Data::Dumper;
+
+my $cases = [
+	[5, 2, 1, 6],
+	[1, 2, 0, 3],
+	[0, 1],
+	[9, 4, 9, 2],
+];
+
+sub smaller_than_current
+{
+	my $l = shift;
+
+	my @res;
+	for my $i (0..$#$l) {
+		my $c = 0;
+		for my $j (0..$#$l) {
+			if ($j == $i) {
+				next;
+			} elsif ($l->[$j] < $l->[$i]) {
+				++$c;
+			}
+		}
+		$res[$i] = $c;
+	}
+
+	return \@res;;
+}
+
+is(smaller_than_current($cases->[0]), [2, 1, 0, 3], 'Example 1');
+is(smaller_than_current($cases->[1]), [1, 2, 0, 3], 'Example 2');
+is(smaller_than_current($cases->[2]), [0, 1],       'Example 3');
+is(smaller_than_current($cases->[3]), [2, 1, 2, 0], 'Example 4');
+done_testing();
+
+exit 0;
diff --git a/challenge-257/peter-meszaros/perl/ch-2.pl b/challenge-257/peter-meszaros/perl/ch-2.pl
new file mode 100755
index 0000000000..91456dda7c
--- /dev/null
+++ b/challenge-257/peter-meszaros/perl/ch-2.pl
@@ -0,0 +1,180 @@
+#!/usr/bin/env perl
+#
+# Given a matrix M, check whether the matrix is in reduced row echelon form.
+# 
+# A matrix must have the following properties to be in reduced row echelon form:
+# 
+# 1. If a row does not consist entirely of zeros, then the first
+#    nonzero number in the row is a 1. We call this the leading 1.
+# 2. If there are any rows that consist entirely of zeros, then
+#    they are grouped together at the bottom of the matrix.
+# 3. In any two successive rows that do not consist entirely of zeros,
+#    the leading 1 in the lower row occurs farther to the right than
+#    the leading 1 in the higher row.
+# 4. Each column that contains a leading 1 has zeros everywhere else
+#    in that column.
+# 
+# For example:
+# 
+# [
+#    [1,0,0,1],
+#    [0,1,0,2],
+#    [0,0,1,3]
+# ]
+# 
+# The above matrix is in reduced row echelon form since the first nonzero
+# number in each row is a 1, leading 1s in each successive row are farther to the
+# right, and above and below each leading 1 there are only zeros.
+# 
+# For more information check out this wikipedia article.
+# 
+# Example 1
+# 
+#     Input: $M = [
+#                   [1, 1, 0],
+#                   [0, 1, 0],
+#                   [0, 0, 0]
+#                 ]
+#     Output: 0
+# 
+# Example 2
+# 
+#     Input: $M = [
+#                   [0, 1,-2, 0, 1],
+#                   [0, 0, 0, 1, 3],
+#                   [0, 0, 0, 0, 0],
+#                   [0, 0, 0, 0, 0]
+#                 ]
+#     Output: 1
+# 
+# Example 3
+# 
+#     Input: $M = [
+#                   [1, 0, 0, 4],
+#                   [0, 1, 0, 7],
+#                   [0, 0, 1,-1]
+#                 ]
+#     Output: 1
+# 
+# Example 4
+# 
+#     Input: $M = [
+#                   [0, 1,-2, 0, 1],
+#                   [0, 0, 0, 0, 0],
+#                   [0, 0, 0, 1, 3],
+#                   [0, 0, 0, 0, 0]
+#                 ]
+#     Output: 0
+# 
+# Example 5
+# 
+#     Input: $M = [
+#                   [0, 1, 0],
+#                   [1, 0, 0],
+#                   [0, 0, 0]
+#                 ]
+#     Output: 0
+# 
+# Example 6
+# 
+#     Input: $M = [
+#                   [4, 0, 0, 0],
+#                   [0, 1, 0, 7],
+#                   [0, 0, 1,-1]
+#                 ]
+#     Output: 0
+# 
+
+use strict;
+use warnings;
+use Test2::V0 -no_srand => 1;
+use Data::Dumper;
+
+my $cases = [
+	[
+		[1, 1, 0],
+		[0, 1, 0],
+		[0, 0, 0],
+	],
+	[
+		[0, 1,-2, 0, 1],
+		[0, 0, 0, 1, 3],
+		[0, 0, 0, 0, 0],
+		[0, 0, 0, 0, 0],
+	],
+	[
+		[1, 0, 0, 4],
+		[0, 1, 0, 7],
+		[0, 0, 1,-1],
+	],
+	[
+		[0, 1,-2, 0, 1],
+		[0, 0, 0, 0, 0],
+		[0, 0, 0, 1, 3],
+		[0, 0, 0, 0, 0],
+	],
+	[
+		[0, 1, 0],
+		[1, 0, 0],
+		[0, 0, 0],
+	],
+	[
+		[4, 0, 0, 0],
+		[0, 1, 0, 7],
+		[0, 0, 1,-1],
+	],
+];
+
+sub printm
+{
+    my $m = shift;
+
+    print "[ ", join(', ', @$_), " ]\n" for @$m;
+}
+
+sub reduced_row_echelon
+{
+	my $m = shift;
+
+    #printm($m);
+    my $prev_pos = -1;
+	my $has_allzero_row = 0;
+    for my $row (@$m) {
+        # 1. If a row does not consist entirely of zeros, then the first
+        #    nonzero number in the row is a 1. We call this the leading 1.
+        my ($one_pos) = grep { $row->[$_] } 0..$#$row; # undef if all zeros
+        return 0 if defined $one_pos && $row->[$one_pos] != 1;
+        
+        # 2. If there are any rows that consist entirely of zeros, then
+        #    they are grouped together at the bottom of the matrix.
+        if (!defined $one_pos) {
+            return 0 if defined $prev_pos && $has_allzero_row;
+			$has_allzero_row = 1;
+            $prev_pos = $one_pos;
+            next;
+		}
+
+        # 3. In any two successive rows that do not consist entirely of zeros,
+        #    the leading 1 in the lower row occurs farther to the right than
+        #    the leading 1 in the higher row.
+        return 0 if defined $prev_pos && $one_pos <= $prev_pos;
+        $prev_pos = $one_pos;
+
+        # 4. Each column that contains a leading 1 has zeros everywhere else
+        #    in that column.
+        my @col = grep {$m->[$_]->[$one_pos]} 0..$#$m;
+        return 0 unless @col == 1 && $m->[$col[0]]->[$one_pos] == 1;
+    }
+    return 1;
+}
+
+is(reduced_row_echelon($cases->[0]), 0, 'Example 1');
+is(reduced_row_echelon($cases->[1]), 1, 'Example 2');
+is(reduced_row_echelon($cases->[2]), 1, 'Example 3');
+is(reduced_row_echelon($cases->[3]), 0, 'Example 4');
+is(reduced_row_echelon($cases->[4]), 0, 'Example 5');
+is(reduced_row_echelon($cases->[5]), 0, 'Example 6');
+done_testing();
+
+exit 0;
+