diff options
| -rw-r--r-- | challenge-101/abigail/README.md | 129 |
1 files changed, 68 insertions, 61 deletions
diff --git a/challenge-101/abigail/README.md b/challenge-101/abigail/README.md index dbe8b526f6..4b45691bcf 100644 --- a/challenge-101/abigail/README.md +++ b/challenge-101/abigail/README.md @@ -1,96 +1,103 @@ # Solution by Abigail -## [Fun Time](https://perlweeklychallenge.org/blog/perl-weekly-challenge-100/#TASK1) +## [Pack a Spiral](https://perlweeklychallenge.org/blog/perl-weekly-challenge-101/#TASK1) -You are given a time (12 hour / 24 hour). +You are given an array `@A` of items (integers say, but they can be anything). -Write a script to convert the given time from 12 hour format to 24 -hour format and vice versa. +Your task is to pack that array into an `MxN` matrix spirally +counterclockwise, as tightly as possible. -Ideally we expect a one-liner. +'Tightly' means the absolute value `|M-N|` of the difference has to be as +small as possible ### Examples +#### Example 1 +~~~~ +Input: @A = (1,2,3,4) + +Output: + + 4 3 + 1 2 ~~~~ -Input: 05:15 pm or 05:15pm -Output: 17:15 -Input: 19:15 -Output: 07:15 pm or 07:15pm +Since the given array is already a `1x4` matrix on its own, but that's +not as tight as possible. Instead, you'd spiral it counterclockwise into + +~~~~ + 4 3 + 1 2 +~~~~ +#### Example 2 +~~~~ +Input: @A = (1..6) + +Output: + + 6 5 4 + 1 2 3 +~~~~ +or +~~~~ + 5 4 + 6 3 + 1 2 +~~~~ +Either will do as an answer, because they're equally tight. + +#### Example 3 +~~~~ +Input: @A = (1..12) + +Output: + 9 8 7 6 + 10 11 12 5 + 1 2 3 4 +~~~~ +or +~~~~ + 8 7 6 + 9 12 5 + 10 11 4 + 1 2 3 ~~~~ ### Solutions -* [GNU AWK](awk/ch-1.gawk) -* [Bash](bash/ch-1.sh) -* [Befunge-93](befunge-93/ch-1.bf93) -* [C](c/ch-1.c) -* [Lua](lua/ch-1.lua) -* [Node.js](node/ch-1.js) -* [Perl](perl/ch-1.pl) -* [Python](python/ch-1.py) -* [Ruby](ruby/ch-1.rb) ### Blog -[Perl Weekly Challenge 100: Fun Time](https://wp.me/pcxd30-qr) -## [Triangle Sum](https://perlweeklychallenge.org/blog/perl-weekly-challenge-100/#TASK2) +## [Origin-containing Triangle](https://perlweeklychallenge.org/blog/perl-weekly-challenge-101/#TASK2) -You are given triangle array. +You are given three points in the plane, as a list of six co-ordinates: +`A=(x1,y1)`, `B=(x2,y2)` and `C=(x3,y3)`. -Write a script to find the minimum path sum from top to bottom. +Write a script to find out if the triangle formed by the given three +co-ordinates contain origin `(0,0)`. -When you are on index `i` on the current row then you may move to -either index `i` or index `i + 1` on the next row. +Print `1` if found otherwise `0`. ### Examples #### Example 1 ~~~~ -Input: Triangle = [ [1], [2,4], [6,4,9], [5,1,7,2] ] -Output: 8 +Input: A=(0,1), B=(1,0) and C=(2,2) -Explanation: The given triangle - - 1 - 2 4 - 6 4 9 - 5 1 7 2 - -The minimum path sum from top to bottom: 1 + 2 + 4 + 1 = 8 - - [1] - [2] 4 - 6 [4] 9 - 5 [1] 7 2 +Output: 0 because that triangle does not contain (0,0). ~~~~ #### Example 2 ~~~~ -Input: Triangle = [ [3], [3,1], [5,2,3], [4,3,1,3] ] -Output: 7 +Input: A=(1,1), B=(-1,1) and C=(0,-3) -Explanation: The given triangle - - 3 - 3 1 - 5 2 3 - 4 3 1 3 +Output: 1 because that triangle contains (0,0) in its interior. +~~~~ -The minimum path sum from top to bottom: 3 + 1 + 2 + 1 = 7 +#### Example 3 +~~~~ +Input: A=(0,1), B=(2,0) and C=(-6,0) - [3] - 3 [1] - 5 [2] 3 - 4 3 [1] 3 +Output: 1 because (0,0) is on the edge connecting B and C. ~~~~ ### Solutions -* [AWK](awk/ch-2.awk) -* [Bash](bash/ch-2.sh) -* [C](c/ch-2.c) -* [Lua](lua/ch-2.lua) -* [Node.js](node/ch-2.js) -* [Perl](perl/ch-2.pl) -* [Python](python/ch-2.py) -* [Ruby](ruby/ch-2.rb) ### Blog -[Perl Weekly Challenge 100: Triangle Sum](https://wp.me/pcxd30-qP) |