diff options
| -rw-r--r-- | challenge-115/abigail/README.md | 2 | ||||
| -rw-r--r-- | challenge-115/abigail/blog.txt | 1 | ||||
| -rw-r--r-- | challenge-115/abigail/blog1.txt | 1 | ||||
| -rw-r--r-- | challenge-115/abigail/perl/ch-1.pl | 3 |
4 files changed, 6 insertions, 1 deletions
diff --git a/challenge-115/abigail/README.md b/challenge-115/abigail/README.md index 725668ba25..96adeb6d8f 100644 --- a/challenge-115/abigail/README.md +++ b/challenge-115/abigail/README.md @@ -61,4 +61,4 @@ Output: 7614 * [Ruby](ruby/ch-2.rb) ### Blog -[String Chain](https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-115-2.html) +[Largest Multiple](https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-115-2.html) diff --git a/challenge-115/abigail/blog.txt b/challenge-115/abigail/blog.txt new file mode 100644 index 0000000000..861aa7f1f2 --- /dev/null +++ b/challenge-115/abigail/blog.txt @@ -0,0 +1 @@ +https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-115-1.html diff --git a/challenge-115/abigail/blog1.txt b/challenge-115/abigail/blog1.txt new file mode 100644 index 0000000000..fe3bebed56 --- /dev/null +++ b/challenge-115/abigail/blog1.txt @@ -0,0 +1 @@ +https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-115-2.html diff --git a/challenge-115/abigail/perl/ch-1.pl b/challenge-115/abigail/perl/ch-1.pl index 2b26121b56..220ff32597 100644 --- a/challenge-115/abigail/perl/ch-1.pl +++ b/challenge-115/abigail/perl/ch-1.pl @@ -33,6 +33,9 @@ use Algorithm::Graphs::TransitiveClosure qw [floyd_warshall]; # We will output 1 if there is *any* cycle. Including looping back to # itself. So, if the input contains the word "eye", we will return 1. # +# See https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-115-1.html +# for details on how the algorithm in the module works. +# while (<>) { # |