The Weekly Challenge

09. TASK #1: Divisor Last Digit

HEADLINES

Today is the first Monday of the month. You guessed it right, time to declare the Champion of The Weekly Challenge. With great pride, I declare W. Luis Mochan as our next Champion. Luis joined the Team PWC in the Week 88. Till date, he has contributed 102 Perl solutions and 51 blogs. He only missed 3 weeks ever i.e. 103, 104 and 105. He is currently ranked 30th with score 306 in the leaderboard. He also became the 52nd member qualified for the 1000 days celebration.

Talking about the celebration, so far, we have received £582.81 in donations. As of today, 29 of 52 members have responded to my email. I am hoping in the next few days, remaining would get back with the details (T-shirt size and delivery address). I would like to thank each and every sponsors. Thanks to all members who shared the details with me. I can assure you that your data is in safe hands.

I am keeping the blog post for up to date. Please do check out if you are interested.

As soon as I get ithe details of the remaining qualified members, I would start designing the T-shirt and prepare the order so that it can be dispatch on time.

As you all know, we are running Advent Calendar for the 3rd time in a row. I would like to thank all the contributors to the Advent Calendar 2021.

Thank you, Peter Campbell Smith, for your first blog of The Weekly Challenge.

Recently joined member, Kaushik Tunuguntla, shared his first solutions in Perl. Not only that he also shared the blog post. Thank you, Kaushik.

Advent Calendar 2021

Day 1: Palindrome Number by Abigail.

Day 2: Edit Distance by Dave Jacoby.

Day 3: Caesar Cipher by Arne Sommer.

Day 4: Triangle Sum by Flavio Poletti.

Day 5: Pack a Spiral by Simon Green.

Day 6: Aaron Smith by Aaron Smith.

Blogs with Creative Title

1. Like, It’s Just the First Ten Numbers Man! by Adam Russell.

2. Numbly Numbers with Raku by Arne Sommer.

3. I Like Numbers And Hate Division: The Weekly Challenge #141 by Dave Jacoby

4. Divisibility, Sieves and Masks - PWC 141 by Kaushik Tunuguntla.

5. Some prime thoughts on divisors by Peter Campbell Smith.

6. The Weekly Challenge 141: Binary and Tabular by Roger Bell_West.

Let us share some interesting stats from the GitHub repository.

1. Commits: 21,814 (+131)

2. Pull Requests: 5,327 (+32)

3. Contributors: 183

4. Fork: 233

5. Stars: 114 (+1)

Last but not least, I would like to thank each and every member for their support and encouragement.

Our solo sponsor Pete Sergeant has been a great support to keep us motivated. We are lucky that he agreed to continue the journey with us in the year 2021. I would like to personally thank Pete and his entire team for their generosity. It would be great if we could add few more to sponsor the prize money so that we could go back and declare weekly champions as we have done in the past. I hope and wish this will become possible in 2021. The amount doesn’t have to be huge. However, it would be nice to show off bunch of supporters. If an organisation comes forward and supports us then that would be the ultimate achievement.

RECAP

Quick recap of “The Weekly Challenge - 141” by Mohammad S Anwar.

PERL REVIEW

Please check out Perl solutions review of the “The Weekly Challenge - 137” by Colin Crain.

If you missed any past reviews then please check out the collection.

RAKU REVIEW

If you missed any past reviews then please check out the collection.

CHART

Please take a look at the charts showing interesting data.

I would like to THANK every member of the team for their valuable suggestions. Please do share your experience with us.

NEW MEMBERS

Please find out How to contribute?, if you have any doubts.

Please try the excellent tool EZPWC created by respected member Saif Ahmed of Team PWC.

GUESTS

Please checkout the guest contributions for the Week #141.

Please find past solutions by respected guests. Please share your creative solutions in other languages.

TASK #1 › Divisor Last Digit

Submitted by: Mohammad S Anwar

You are given positive integers, $m and $n.

Write a script to find total count of divisors of $m having last digit $n.

Example 1:

Input: $m = 24, $n = 2
Output: 2

The divisors of 24 are 1, 2, 3, 4, 6, 8 and 12.
There are only 2 divisors having last digit 2 are 2 and 12.

Example 2:

Input: $m = 30, $n = 5
Output: 2

The divisors of 30 are 1, 2, 3, 5, 6, 10 and 15.
There are only 2 divisors having last digit 5 are 5 and 15.

TASK #2 › Sleep Sort

Submitted by: Adam Russell

Another joke sort similar to JortSort suggested by champion Adam Russell.

You are given a list of numbers.

Write a script to implement Sleep Sort. For more information, please checkout this post.

Last date to submit the solution 23:59 (UK Time) Sunday 12th December 2021.