The Weekly Challenge - 089

Monday, Nov 30, 2020| Tags: Perl, Raku

TABLE OF CONTENTS


1. HEADLINES

2. RECAP

3. PERL REVIEW

4. RAKU REVIEW

5. CHART

6. NEW MEMBERS

7. GUESTS

8. TASK #1: GCD Sum

9. TASK #2: Magical Matrix


HEADLINES


Finally we managed to get the interview with Andrew Shitov.

We have four new members joining the team this week. W. Luis Mochan, Henry Wong, Miguel Prz and Aaron Smith.

Contributions Summary

This week, we had 39 contributions by guests in 17 different languages. We matched the previous best contributions in the Week 80. Two new languages added to the list Fish and PHP. I would like to THANK each and every guest contributors.

Languages Summary


While we are talking about contributions, lets share some interesting stats from the GitHub repository.

1) Commits: 11,826 (+229)

2) Pull Requests: 2,877 (+56)

3) Contributors: 147 (+4)

4) Fork: 186 (+5)

5) Stars: 84 (+1)


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

RECAP


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


PERL REVIEW


If you missed any past reviews then please checkout the collection.


RAKU REVIEW


If you missed any past reviews then please checkout 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


1) W. Luis Mochan

2) Henry Wong

3) Miguel Prz from Spain.

4) Aaron Smith from Austix, TX.

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

Please give it a try to an excellent tool EZPWC created by respected member Saif Ahmed of Team PWC.


GUESTS


1) Abigail shared solutions to Task #1 and Task #2 in C.

2) Abigail shared solutions to Task #1 and Task #2 in Node.

3) Adam Russell shared solutions to Task #1 and Task #2 in Prolog.

4) Henry Wong shared solutions to Task #1 and Task #2 in PHP.

5) Lubos Kolouch shared solutions to Task #1 and Task #2 in Python.

6) Myoungjin Jeon shared solutions to Task #1 and Task #2 in Elm.

7) Myoungjin Jeon shared solution to Task #1 in Fish.

8) Myoungjin Jeon shared solutions to Task #1 and Task #2 in Go.

9) Myoungjin Jeon shared solutions to Task #1 and Task #2 in Haskell.

10) Myoungjin Jeon shared solutions to Task #1 and Task #2 in Lisp.

11) Nuno Vieira shared solutions to Task #1 and Task #2 in JavaScript.

12) Richard Park shared solutions to Task #1 and Task #2 in APL.

13) Richard Park shared solutions to Task #1 and Task #2 in JavaScript.

14) Richard Park shared solutions to Task #1 and Task #2 in Python.

15) Roger Bell_West shared solutions to Task #1 and Task #2 in Python.

16) Roger Bell_West shared solutions to Task #1 and Task #2 in Ruby.

17) Roger Bell_West shared solutions to Task #1 and Task #2 in Rust.

18) Tyler Wardhaugh shared solutions to Task #1 and Task #2 in Clojure.

19) Tyler Wardhaugh shared solutions to Task #1 and Task #2 in Lua.

20) Ulrich Rieke shared solution to Task #1 in C++.

21) Ulrich Rieke shared solution to Task #1 in Haskell.


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


TASK #1 › GCD Sum

Submitted by: Mohammad S Anwar

You are given a positive integer $N.

Write a script to sum GCD of all possible unique pairs between 1 and $N.

Example 1:

Input: 3
Output: 3

gcd(1,2) + gcd(1,3) + gcd(2,3)

Example 2:

Input: 4
Output: 7

gcd(1,2) + gcd(1,3) + gcd(1,4) + gcd(2,3) + gcd(2,4) + gcd(3,4)


TASK #2 › Magical Matrix

Submitted by: Mohammad S Anwar

Write a script to display matrix as below with numbers 1 - 9. Please make sure numbers are used once.

[ a b c ]
[ d e f ]
[ g h i ]

So that it satisfies the following:

a + b + c = 15
d + e + f = 15
g + h + i = 15
a + d + g = 15
b + e + h = 15
c + f + i = 15
a + e + i = 15
c + e + g = 15


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


SO WHAT DO YOU THINK ?

If you have any suggestions or ideas then please do share with us.

Contact with me