Merge pull request #180 from adamcrussell/challenge-009

Challenge 009

3 files changed, 196 insertions, 0 deletions

diff --git a/challenge-009/adam-russell/blog.txt b/challenge-009/adam-russell/blog.txt
new file mode 100644
index 0000000000..cd7ca97aa6
--- /dev/null
+++ b/challenge-009/adam-russell/blog.txt
@@ -0,0 +1 @@
+https://adamcrussell.livejournal.com/3377.html
diff --git a/challenge-009/adam-russell/perl5/ch-1.pl b/challenge-009/adam-russell/perl5/ch-1.pl
new file mode 100644
index 0000000000..cf897761ad
--- /dev/null
+++ b/challenge-009/adam-russell/perl5/ch-1.pl
@@ -0,0 +1,30 @@
+use strict;
+use warnings;
+##
+# Write a script that finds the first square number that has at least 5 distinct digits.
+##  
+use boolean;
+use constant X_0 => 100; 
+
+sub is_distinct_five{
+    my($n) = @_;
+    my @digits = split(//, $n);
+    my @unique_digits = keys %{{map {$_ => 1} @digits}};
+    if(@unique_digits >= 5){
+        return true;
+    }
+    return false; 
+}
+
+
+##
+# Main
+##
+my $x = X_0 - 1;
+my $found = false;
+do{
+    $x++;  
+    $found = is_distinct_five($x**2);  
+}until($found);  
+print "First square with five distinct digits: ";
+print $x**2 . " (= $x * $x)\n"; 
diff --git a/challenge-009/adam-russell/perl5/ch-2.pl b/challenge-009/adam-russell/perl5/ch-2.pl
new file mode 100644
index 0000000000..5fc9782abe
--- /dev/null
+++ b/challenge-009/adam-russell/perl5/ch-2.pl
@@ -0,0 +1,165 @@
+use strict;
+use warnings;
+##
+# Write a script to perform ranking as described below:
+# 1. Standard Ranking (1224): Items that compare equal receive the same 
+# ranking number, and then a gap is left in the ranking numbers.
+# 2. Modified Ranking (1334): It is done by leaving the gaps in the 
+# ranking numbers before the sets of equal-ranking items.
+# 3. Dense Ranking    (1223): Items that compare equally receive 
+# the same ranking number, and the next item(s) receive the immediately 
+# following ranking number.
+##  
+use boolean;
+use Tie::RefHash;
+
+package Thing{
+    use boolean;  
+    sub new{ 
+        my ($pkg, $values) = (@_);  
+        my $attributes = {
+            score => $values->{score} || -1,
+            name  => $values->{name}  || ""  
+        };
+        return bless($attributes, $pkg);  
+    }  
+    sub get_score{
+        my($self) = @_;  
+        return $self->{score};  
+    }  
+    sub get_name{
+        my($self) = @_;  
+        return $self->{name};  
+    }  
+    true;  
+};    
+
+##
+# sorting and ranking functions   
+##   
+sub sorter{
+    my($a, $b, $accessor_function) = @_; 
+    return $a->$accessor_function <=> $b->$accessor_function;   
+}
+
+sub standard_rank{
+    my($sorted_objects, $accessor_function) = @_; 
+    my %ranking; 
+    my $rank = 1; 
+    my $current_rank; 
+    my $previous; 
+    tie %ranking, "Tie::RefHash"; 
+    for my $o (@{$sorted_objects}){
+        my $a = $o->$accessor_function;
+        if(!$previous){
+            $previous = $a; 
+            $ranking{$o} = $rank; 
+            $current_rank = $rank; 
+        } 
+        else{
+            if($previous == $a){
+                $ranking{$o} = $current_rank;
+                $rank++;  
+            }  
+            if($previous != $a){
+                $previous = $a; 
+                $rank++;  
+                $ranking{$o} = $rank; 
+                $current_rank = $rank; 
+            }  
+        }  
+    }   
+    return \%ranking; 
+} 
+
+sub modified_rank{
+    my($sorted_objects, $accessor_function) = @_; 
+    my %ranking; 
+    my $rank = 1; 
+    my $current_rank = 1; 
+    my $previous; 
+    my $has_previous = false;
+    tie %ranking, "Tie::RefHash"; 
+    for my $o (@{$sorted_objects}){
+        my $a = $o->$accessor_function;
+        if(!$previous){
+            $previous = $o; 
+            $ranking{$o} = $current_rank; 
+        } 
+        else{
+            if($previous->get_score() == $a){
+                if(!$has_previous && $current_rank != 1){
+                    $has_previous = true;
+                    $current_rank++;
+                }
+                $ranking{$previous} = $current_rank;
+                $ranking{$o} = $current_rank;
+            }  
+            if($previous->get_score() != $a){
+                $has_previous = false;
+                $previous = $o; 
+                $ranking{$o} = $rank ; 
+                $current_rank = $rank;
+            }  
+        }  
+        $rank++;    
+    }   
+    return \%ranking; 
+} 
+
+sub dense_rank{
+    my($sorted_objects, $accessor_function) = @_; 
+    my %ranking; 
+    my $rank = 1; 
+    my $current_rank; 
+    my $previous; 
+    tie %ranking, "Tie::RefHash"; 
+    for my $o (@{$sorted_objects}){
+        my $a = $o->$accessor_function;
+        if(!$previous){
+            $previous = $a; 
+            $ranking{$o} = $rank; 
+            $current_rank = $rank; 
+        } 
+        else{
+            if($previous == $a){
+                $ranking{$o} = $current_rank;
+            }  
+            if($previous != $a){
+                $previous = $a; 
+                $rank++;  
+                $ranking{$o} = $rank; 
+                $current_rank = $rank; 
+            }  
+        }  
+    }   
+    return \%ranking; 
+} 
+ 
+##
+# Main   
+##
+my @things; 
+my $rankings; 
+my @characters = ("A".."Z");
+for(0..9){
+    my $string;
+    $string .= $characters[rand @characters] for 1..3; 
+    push @things, new Thing({score => int(rand(10)+1), name => $string});  
+}  
+@things = sort {sorter($a, $b, \&Thing::get_score)} @things; 
+$rankings = standard_rank(\@things, \&Thing::get_score); 
+print "Name\tScore\tRank\n";
+foreach my $key (sort {$rankings->{$a} <=> $rankings->{$b}} keys %{$rankings}) {
+    printf("%s\t%d\t%d\n", $key->get_name(), $key->get_score(), $rankings->{$key});
+}
+print "================\n";
+$rankings = modified_rank(\@things, \&Thing::get_score); 
+foreach my $key (sort {$rankings->{$a} <=> $rankings->{$b}} keys %{$rankings}) {
+    printf("%s\t%d\t%d\n", $key->get_name(), $key->get_score(), $rankings->{$key});
+}
+print "================\n";
+$rankings = dense_rank(\@things, \&Thing::get_score); 
+foreach my $key (sort {$rankings->{$a} <=> $rankings->{$b}} keys %{$rankings}) {
+    printf("%s\t%d\t%d\n", $key->get_name(), $key->get_score(), $rankings->{$key});
+}