aboutsummaryrefslogtreecommitdiff
path: root/challenge-195
diff options
context:
space:
mode:
authorLoneWolfiNTj <LagrangeL2@gmail.com>2022-12-16 02:52:55 -0800
committerLoneWolfiNTj <LagrangeL2@gmail.com>2022-12-16 02:52:55 -0800
commit416feb177859e04c27a3318b5cc3afdbfeb9c832 (patch)
tree33a8b48a514fdbcd40c184e037c1e5863c171d34 /challenge-195
parent07b57d199e76a2dc00af8ebc87ba6988269e9da5 (diff)
downloadperlweeklychallenge-club-416feb177859e04c27a3318b5cc3afdbfeb9c832.tar.gz
perlweeklychallenge-club-416feb177859e04c27a3318b5cc3afdbfeb9c832.tar.bz2
perlweeklychallenge-club-416feb177859e04c27a3318b5cc3afdbfeb9c832.zip
Robbie Hatley's Perl solutions to challenge 195, with error corrections
Diffstat (limited to 'challenge-195')
-rwxr-xr-xchallenge-195/LoneWolfiNTj/perl/ch-2.pl5
1 files changed, 2 insertions, 3 deletions
diff --git a/challenge-195/LoneWolfiNTj/perl/ch-2.pl b/challenge-195/LoneWolfiNTj/perl/ch-2.pl
index 7ec2efae57..2d4594c7d1 100755
--- a/challenge-195/LoneWolfiNTj/perl/ch-2.pl
+++ b/challenge-195/LoneWolfiNTj/perl/ch-2.pl
@@ -22,9 +22,8 @@ Example 3: Input: (6,4,4,6,1) Output: 4
# If using args, they should be integers, and will be assumed
# to be a single array.
-# NOTE: Output is to stdout and will be each input number
-# $n followed by the count of all "special" integers
-# from 1 through $n.
+# NOTE: Output is to stdout and will be each input array followed by
+# smallest most-frequent even number, or -1 if no evens.
# PRELIMINARIES:
use v5.36;