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 258

PWC 258 Last week (#257) I finished challenge 2 and my blog post for challenge 257 late last week, so had only submitted challenge 1. Here is my blog post for PWC 257 , including the full code for my challenge 2 solution. This week, I have done both challenges in perl 4.019 on DOSBOX. Both scripts also work fine on the latest Perl 5.38. I also did the challenges in Raku, where they are one-liners.  Challenge 1 (Count Even Digits Number) We are given a list of integers, and asked to count the number of elements whose base-10 representation has an even number of digits. In Raku , this is a one-liner. Here it is: raku -e 'say +@*ARGS.grep({$_.chars %% 2})' $@ It could be a one-liner in Perl 4 too, but since I run it on DOSBOX, my script would not be a bash shell script. Here is the short subroutine that does the job.  sub count_even_digits {  scalar( grep( ((length($_) % 2) == 0), @_) ); } The full code is here . Challenge 2 (Sum of values) We are given an integer k  and a list in
Read more

PWC 249

PWC 249 Challenge 1 (Equal pairs) We are given a list of integers with an even number of elements. We are asked to check if the list can be completely divided into sub-lists of size 2 with each sub-list containing the same integer repeated, like say (2,2). If so, we are asked to return the list of such sub-lists. This is straightforward in Perl 5. I use modern conveniences this time, though it could be done using only primitive Perl 4 syntax. Here is my subroutine. It returns a list of array references. local *equal_pairs = sub {     #-- return () if input is of odd length     ((scalar(@_) % 2) > 0) && (return ());          #-- count number of occurrences of each element using a hash     local %_ = ();     map {$_{$_}++} @_;          #-- if any element occurs an odd number of times, return ()     (grep {($_{$_} % 2) > 0} keys %_) && (return ());          #-- loop thru %_ keys, returning pairs of such keys     map {         my $k=$_;         my $num_pairs=( ($_{$k}
Read more

PWC 253

PWC 253 I do both challenges this week using old software on DOSBOX: perl 4.019, and for comparison, also python 1.4 beta. My solutions also work on the current versions of Perl 5 (5.38) and Python 2 (2.7.18) respectively. Challenge 1 (Split Strings) Links to code: perl4.019 python1.4b We are given a list of strings, and a single character say sep . We are asked to return the list, with the strings split into component substrings using sep as a separator. We should not include any empty strings in the output. In perl 4, I first stick a backslash in front of the separator character, so that it is escaped if entered in a regex. This is because the perl split function takes a regex as its first argument indicating the separator. If we have a character like '$' or ',', we want to escape it so that it is read literally when parsing the regex. Here is the key subroutine:   sub split_strings {  local ($separator, @words)=@_;  local (@retval)=(); #array to be returned  #  #--
Read more