aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAbigail <abigail@abigail.be>2021-05-18 21:13:47 +0200
committerAbigail <abigail@abigail.be>2021-05-18 21:13:47 +0200
commitebf6f4e9f1f3c685d7b06b5033fd82f355e4523d (patch)
treef43e7d96acb98023157d4a61e9e4cb2cbc832cdb
parentd15beb5dcb76d40a0c324a9be4da7d570976c911 (diff)
downloadperlweeklychallenge-club-ebf6f4e9f1f3c685d7b06b5033fd82f355e4523d.tar.gz
perlweeklychallenge-club-ebf6f4e9f1f3c685d7b06b5033fd82f355e4523d.tar.bz2
perlweeklychallenge-club-ebf6f4e9f1f3c685d7b06b5033fd82f355e4523d.zip
Make AWK and Perl solutions more in line
-rw-r--r--challenge-113/abigail/awk/ch-1.awk6
-rw-r--r--challenge-113/abigail/perl/ch-1.pl5
2 files changed, 6 insertions, 5 deletions
diff --git a/challenge-113/abigail/awk/ch-1.awk b/challenge-113/abigail/awk/ch-1.awk
index 4dd17cbbe5..91923aadb6 100644
--- a/challenge-113/abigail/awk/ch-1.awk
+++ b/challenge-113/abigail/awk/ch-1.awk
@@ -9,7 +9,7 @@
#
BEGIN {
- split ("0 1 2 1 0 2 6 3 8", l)
+ split ("0 1 2 1 0 2 6 3 8", tens)
}
{
@@ -20,9 +20,9 @@ BEGIN {
print 1
next
}
- for (i = 1; i <= l [D]; i ++) {
+ for (i = 1; i <= tens [D]; i ++) {
T = N - 10 * i - D
- if ((T >= 0) && (T % D == 0)) {
+ if (T >= 0 && T % D == 0) {
print 1
next
}
diff --git a/challenge-113/abigail/perl/ch-1.pl b/challenge-113/abigail/perl/ch-1.pl
index bd82344f3d..51a4842116 100644
--- a/challenge-113/abigail/perl/ch-1.pl
+++ b/challenge-113/abigail/perl/ch-1.pl
@@ -72,6 +72,7 @@ use experimental 'lexical_subs';
my @l = ([], [], [1], [1 .. 2], [1],
[], [1 .. 2], [1 .. 6], [1 .. 3], [1 .. 8]);
+my @tens = (0, 0, 1, 2, 1, 0, 2, 6, 3, 8);
MAIN: while (<>) {
my ($N, $D) = /[0-9]+/g;
@@ -80,8 +81,8 @@ MAIN: while (<>) {
say 1;
next MAIN;
}
- for my $l (@{$l [$D]}) {
- my $T = $N - 10 * $l - $D;
+ for (my $i = 1; $i <= $tens [$D]; $i ++) {
+ my $T = $N - 10 * $i - $D;
if ($T >= 0 && $T % $D == 0) {
say 1;
next MAIN;