aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJames Smith <js5@sanger.ac.uk>2022-04-25 10:37:43 +0100
committerGitHub <noreply@github.com>2022-04-25 10:37:43 +0100
commit357d132ccf72a5c04d531fc233269c35016a7d31 (patch)
tree53a2f14fd9cfc2bca2990b3258ced27914045ff1
parent30bb1d6595b66cc29338db192f04128dbbde5af8 (diff)
downloadperlweeklychallenge-club-357d132ccf72a5c04d531fc233269c35016a7d31.tar.gz
perlweeklychallenge-club-357d132ccf72a5c04d531fc233269c35016a7d31.tar.bz2
perlweeklychallenge-club-357d132ccf72a5c04d531fc233269c35016a7d31.zip
X
-rw-r--r--challenge-161/james-smith/README.md6
1 files changed, 4 insertions, 2 deletions
diff --git a/challenge-161/james-smith/README.md b/challenge-161/james-smith/README.md
index bd2de9087b..7ae99adb0f 100644
--- a/challenge-161/james-smith/README.md
+++ b/challenge-161/james-smith/README.md
@@ -71,10 +71,10 @@ The list of words are:
```perl
sub generate_a_pangram_random {
my ($list,$c,%letters,@pangram) = (shift,0,map { $_ => 0 } 'a'..'z');
- O: while( $c < 26 ) {
+ O: while( $c < 26 ) { ## Keep a counter of letters used...
my($f,@l) = (1,split //, my $word = $list->[rand @{$list}]);
$f *= $letters{$_} foreach @l;
- next if $f;
+ next if $f; ## Only choose words which have at least one new unique letter
push @pangram, $word;
$letters{$_} || ( $letters{$_}=1, $c++ ) for @l;
}
@@ -191,4 +191,6 @@ sub most_letters {
This gives us *"**oversimpl**i**f**i**cat**io**n** la**dybug** **h**a**wk** **j**a**z**z e**q**uino**x**"*
+If we replace "equinox" with "quixotic" which introduces the same two letters "q" and "x" you could rearrange this to: **Ladybug Hawk - Quixotic jazz oversimplification**. This just sounds like an NME headline!
+
If we stick to the words from challenge 1 - we get *"abhors deity flux know chimp go iv qt jot buzz"*.