aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authordrbaggy <js5@sanger.ac.uk>2022-02-06 18:29:24 +0000
committerdrbaggy <js5@sanger.ac.uk>2022-02-06 18:29:24 +0000
commit8f14df86df64d5b736ce0b50064f6d2f5e738f5e (patch)
tree7e8a7cff76ac0f2773ee1761c6f49aad74ab49a5
parentea7e9c8755e2161069dd3eb935099bb3dbd95348 (diff)
parentab383a53c1779085ee99067753f310aa2c1da315 (diff)
downloadperlweeklychallenge-club-8f14df86df64d5b736ce0b50064f6d2f5e738f5e.tar.gz
perlweeklychallenge-club-8f14df86df64d5b736ce0b50064f6d2f5e738f5e.tar.bz2
perlweeklychallenge-club-8f14df86df64d5b736ce0b50064f6d2f5e738f5e.zip
Merge branch 'master' of github.com:drbaggy/perlweeklychallenge-club
-rw-r--r--challenge-150/james-smith/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-150/james-smith/README.md b/challenge-150/james-smith/README.md
index dcbadeb488..552d615280 100644
--- a/challenge-150/james-smith/README.md
+++ b/challenge-150/james-smith/README.md
@@ -76,7 +76,7 @@ say for grep{my$t=$_;!grep{!($t%$_)}@p2}1..$N;
We can re-write the inefficient double `grep` more elegantly with nested `for`*each* loops. The new code becomes:
```perl
-my ( $N, @p2, @r ) = ( @ARGV ? $ARGV[0] : 500 , 4 );
+my ( $N, @p2 ) = ( @ARGV ? $ARGV[0] : 500 , 4 );
P: for ( my $c = 3; $c*$c <= $N; $c += 2 ) {
$_ > $c ? last : $c*$c % $_ || next P for @p2;