PWC #173

PWC #173

Challenge 1 (Esthetic numbers)

Esthetic numbers are numbers in which consecutive digits are either one less or one more than the (previous or next) other digit. For example, 5_654 is an esthetic number but 120 is not.

We are asked to find a function that tells us whether a particular input number is esthetic or no.

This seems like a good candidate for a regex solution, but I wound up just looping through the characters in the number (as a string) and checking if the next character was one more or less. If not, then it is not esthetic, otherwise it is. I also check that the input is numeric (otherwise not esthetic). In Perl and Raku, I check for and drop the "_" character used as a thousands separator. I have not considered single-digit numbers, the algorithm assumes the number is at least two digits (easy to fix, but I'll leave it). The internet tells me that single-digit numbers are esthetic by convention. My if condition is unnecessarily clunky, I check separately if the consecutive digits are 1 more or 1 less than each other, and then negate that. A better way is to just check if the absolute value  of the difference is greater than 1.

My Perl 5, Raku and Julia scripts are all similar in their logic and even the clunky syntax. In Julia, I was more careful about explicit casting to string and back to Int. As usual, I have done the scripts in Julia too for benchmarking.

Here is my Perl 5 script.

Here is my Raku script.

Here is my Julia script.

There is of course at least one (deceptively easy) regex-based solution, as demonstrated by another contributor, Philippe Bricout alias brxfork here. The insight is that it is easier and faster to look for non-esthetic numbers rather than esthetic ones. For example, if we match 1[^02] (1 followed by anything except 0 or 2), then we know we have a non-esthetic number and return false, and similarly for other digits. If we fail to find a non-esthetic number using this regex, then obviously we have an esthetic number.

Challenge 2 (Sylvester sequence)

The Sylvester sequence is one in which each term is the product of all the previous terms plus one, and the starting term indexed zero equals 2. Equivalently, we have the equation for the i'th term X[i] say: 

X[i] = X[i-1]*(X[i-1]-1)+1

We are asked to find the first 10 terms

In Raku, this is a one-liner.

say (2, {$^x * ($^x-1)+1}...*).head(10)

In Perl 5 and Julia, I use a loop with similar logic. Start with 2 and calculate each term using the formula based on the previous term. Perl 5 uses scientific notation to print out the larger numbers, but otherwise all is similar. All three handle the very large integers with high speed. In Perl 5, I called PDL. PDL does not seem to support bigints. Of course, it's not necessary to use PDL, a regular Perl array would do fine.

Here is my Perl 5 script.

Here is my Raku one-liner.

Here is my Julia script.

 

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 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
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