PWC 227

PWC 227

Challenge 1 (Friday 13th)

This challenge requires us to count the number of times Friday 13th occurs in a particular year.

I use Date::Manip. This module probably has easier ways to do this using a Date Range, but my approach is easy enough. My &friday_13th subroutine takes the year as input, throws an exception if it is outside the specified range (1753 to 9999), and then cycles through the 13th of each month, counting the Fridays.

use Date::Manip;

my $dateobj=Date::Manip::Date->new();

sub friday_13th {
    my ($year)=@_;
    my $retval=0;
    ( ($year > 9999) || ($year < 1753) ) &&
        die "Year should be between 1753 and 9999";

    map {
        ( ($dateobj->new_date("$year-$_-13")->printf('%w') ) == 5 ) &&
            $retval++;
    }
    1 .. 12;
    
    $retval;
}  


Challenge 2 (Roman Maths)

This challenge requires us to implement a calculator that parses infix math operations using roman numerals. 

There are several CPAN modules that do this. I use Math::Roman, which is the most full-featured. It is somewhat more full-featured than the task specification, which requires returning a ``non potest'' for operations that the Romans didn't know how to do (like go beyond 3999 or calculate fractions or write zero as a numeral). 

My subroutine takes the infix expression as input, verifies that it is valid, then checks for various situations where a 'non potest' or 'nulla' (zero in Latin) is called for, and finally evals the expression and returns the output if it is less than 4000.

use Math::Roman qw(roman);

sub roman_maths {
    my ($string)=@_;
    
    ($string =~ /([IVXLCMD]+)\s*([+-\/\*]\**)\s*([IVXLCMD]+)/)
        || die 'Invalid input';
     
     
     ( ($2 eq '-') && ($1 eq $3) ) && return 'nulla';
     
     ( ($2 eq '-') && ( roman($1) < roman($3) ) ) &&
        return 'non potest';
     
     ( ($2 eq '/') && ( (roman($1) % roman($3) ) > 0 ) ) &&
        return 'non potest';
        
     my $roman=eval("roman($1) $2 roman($3)");
     if ($roman > 3999) {
        return 'non potest';
     }
     else {
        return $roman;
    }
}

I realized too late that my input validation regex is not foolproof. It allows the expression to contain gibberish operators like '+*' or '***'. Anyway, inputs like these will throw an error a few steps later, when the expression is eval'd, so รงa va enfin.

Comments

Post a Comment

Popular posts from this blog

PWC 215

PWC 215 I have attempted the Perl Weekly Challenge after a hiatus of several weeks, as I was too busy at work. Still busy, so I have just attempted the current challenge in Perl 5. Like I like to do, I have restricted myself to perl 4 syntax as specified in the first edition of Programming perl. Update and disclaimer : These programs will not work on Perl 4 as I discovered later when I found and installed a Perl 4.019 executable. For one thing, the ability to assign a subroutine to a locally scoped typeglob was not available in Perl 4. Challenge 1 (Odd one out) In this challenge, we are given a list of alphabetic strings, and asked to return the list without the strings in which the characters are not sorted (I assume that this means sorted in lexical ascending order). We are also asked to print the number of strings that were removed (i.e., that were not sorted).  I use a subroutine &odd_one_out(@words) with a nested helper sub-sub-routine to check if a string is sorted. Here i
Read more

PWC 234

PWC 234 I tried to restrict to Perl 4 syntax for both challenges this week, as documented in Rex Swain's Perl 4 reference or the 1st edition of Programming perl. I do use nested subroutines, which I am not sure would actually work in Perl 4, though they comply with the syntax. My programs are tested on Perl 5.38. (The -l in the shebang line works only in Perl 5. The Perl 4 equivalent was -L012 in Unix, which is no longer available.) As I have mentioned before, my aims in using the old syntax are just mild nostalgia plus to add a bit of additional challenge to the task. I know that this is not the most efficient or idiomatic way to do things today. But I should observe that it is really cool that I am able to write code using 30-year old syntax, and run it unmodified on the latest Perl 5.38. You cannot do this with Python 3 for example. This very deep backward compatibility is one of those unsung underappreciated beauties of Perl 5. In my opinion, it is a very cool thing in
Read more