aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorWalt Mankowski <waltman@pobox.com>2020-09-04 19:22:00 -0400
committerWalt Mankowski <waltman@pobox.com>2020-09-04 19:22:00 -0400
commit4cb97a1f06004a9e915360c0145d6edfc4b52fa1 (patch)
treee50e014ece18bfd7eebb906ae569ec2db95b281f
parentccff7d7e2cd398bc83ffb9833038c615d3ec982f (diff)
downloadperlweeklychallenge-club-4cb97a1f06004a9e915360c0145d6edfc4b52fa1.tar.gz
perlweeklychallenge-club-4cb97a1f06004a9e915360c0145d6edfc4b52fa1.tar.bz2
perlweeklychallenge-club-4cb97a1f06004a9e915360c0145d6edfc4b52fa1.zip
added a few comments
-rw-r--r--challenge-076/walt-mankowski/perl/ch-1.pl6
1 files changed, 4 insertions, 2 deletions
diff --git a/challenge-076/walt-mankowski/perl/ch-1.pl b/challenge-076/walt-mankowski/perl/ch-1.pl
index d2939f19ff..99ae70ce29 100644
--- a/challenge-076/walt-mankowski/perl/ch-1.pl
+++ b/challenge-076/walt-mankowski/perl/ch-1.pl
@@ -38,14 +38,16 @@ sub primes_upto($n) {
return grep {$is_prime[$_]} 2..$n;
}
+# find n possibly repeating primes, where n <= k, where the primes add
+# up to s
sub sums_goldbach($s, $k, @primes) {
my @solutions;
my $best = 1e300;
my $iter = combinations_with_repetition([0, @primes], $k);
while (my $p = $iter->next) {
- my @digits = grep(!/^0$/, $p->@*);
- next unless @digits;
+ my @digits = grep(!/^0$/, $p->@*); # remove 0s
+ next unless @digits; # ignore (0,0,0)
next unless sum(@digits) == $s;
if (@digits < $best) {
@solutions = (join " + ", @digits);