PWC 198

PWC 198

Our good host has given us easy challenges this week, which works for me as I am busy at work. Still, I have done them only in Perl 5 and Raku and skipped Julia this time.

Challenge 2 (Prime Count)

We are asked to find the number of prime integers between 0 and a given positive integer $n. The challenge specifies that we are looking for primes that are strictly less than $n (which I nearly missed, but caught in time).

This is an easy one-liner if one does not try to implement a prime sieve from scratch (I don't). Here it is in Raku:

raku -e '(0..^@*ARGS[0]).grep(*.is-prime).elems.say' $@

We need the ^ in ^@*ARGS[0] to exclude $n (the command-line argument) itself from the count. 

In Perl 5, I use the Math::Prime::Util function "prime_count". 

perl -MMath::Prime::Util=prime_count -wl -e 'print prime_count($ARGV[0]-1)' $@

We subtract one from the command-line argument to exclude it from the count. The "prime_count" routine gives the number of primes up to and including its argument.

Challenge 1 (Max Gap)

We are given a list of integers. We are asked to sort them first, then count the occurrences of the gaps between successive elements. For example, for the input list (1,2,3,4) the gaps are 1 between 3 consecutive pairs of elements ( (1,2), (2,3), (3,4))). We are asked to return the count for the highest gap recorded. If the input list has only one element, we return 0.

This is a classic Perl use of a hash (Of course, there are many other ways to do it too). In Perl 5, I sort the list, then iterate through the sorted list counting gaps with a hash, where the key is the gap, and the value is the count for that gap. Then I sort the hash keys and take the value of the highest one.   Here is the sub-routine:

sub max_gap {
    my (@list) = (sort {$a <=> $b} @_);
    (@list <= 2) && (return 0);
    my %gaps;
    
    map {$gaps{$list[$_+1]-$list[$_]}++}
    (0 .. @list-2);
        
    $gaps{ (sort {$b <=> $a} (keys %gaps))[0] };
}

Here is the direct translation to Raku:

sub max-gap (@list) {
    my (@sorted_list) = @list.sort( {$^a <=> $^b} );
    (@list.elems <= 2) && (return 0);
    my %gaps;
        
    (0 .. @sorted_list-2).map( {%gaps{@sorted_list[$_+1]-@sorted_list[$_]}++} );
    
    
    %gaps{ ( (%gaps.keys).sort( {$^b <=> $^a} ))[0] };
}

Both scripts have a silly error. The test for returning zero should be that the list length should be strictly less than two (or one or less), not less than or equal to two as I have it. I didn't read the spec carefully enough when I was scripting. I'll let the programs stand as, let's say, an inadvertent variation from the spec.

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