One-two primes: Difference between revisions
m
→{{header|Perl}}: code formatting
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: improved 'condense' (no args required)) |
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: code formatting) |
||
Line 373:
sub condense($n) { $n =~ /^((.)\2+)/; my $i = length $1; $i>9 ? "($2 x $i) " . substr($n,$i) : $n }
sub combine ($d, $a, $b, $s='') {
}
Line 385:
printf "%4d: %s\n", $_, condense combine($_,$a,$b) for map 100*$_, 1..20;
($a,$b) = (7,9);
say "\nSmallest n digit prime using only $a and $b (or '0' if none exists):";
printf "%4d: %s\n", $_, condense combine($_,$a,$b) for 1..20, 100, 200;
| |||