diff options
| author | drbaggy <js5@sanger.ac.uk> | 2022-06-16 10:02:30 +0100 |
|---|---|---|
| committer | drbaggy <js5@sanger.ac.uk> | 2022-06-16 10:02:30 +0100 |
| commit | 68f76f4aab3253674ac22ee3a0dd7cab3f41f139 (patch) | |
| tree | 099efca05554daf40bb51791f2ac85616eb741b6 /challenge-169 | |
| parent | 9a6f1bdd534d2edc1fc1c9c43c2a0a889168c270 (diff) | |
| download | perlweeklychallenge-club-68f76f4aab3253674ac22ee3a0dd7cab3f41f139.tar.gz perlweeklychallenge-club-68f76f4aab3253674ac22ee3a0dd7cab3f41f139.tar.bz2 perlweeklychallenge-club-68f76f4aab3253674ac22ee3a0dd7cab3f41f139.zip | |
tidied up
Diffstat (limited to 'challenge-169')
| -rw-r--r-- | challenge-169/james-smith/perl/ch-1.pl | 6 | ||||
| -rw-r--r-- | challenge-169/james-smith/perl/ch-2.pl | 6 |
2 files changed, 6 insertions, 6 deletions
diff --git a/challenge-169/james-smith/perl/ch-1.pl b/challenge-169/james-smith/perl/ch-1.pl index 029bc36c6c..775040f182 100644 --- a/challenge-169/james-smith/perl/ch-1.pl +++ b/challenge-169/james-smith/perl/ch-1.pl @@ -13,9 +13,9 @@ my $time = time; # must have preciesely 2 prime factors # THEN each factor must be the same length; -for( my( $n, $c, $MAX, @f ) = ( 0, 0, @ARGV ? $ARGV[0] : 1e2 ); $c<$MAX; $n++ ) { - say sprintf '%8d: %10d = %5d x %d', ++$c, $n, @f - if 2 == ( @f = factor $n ) && length $f[0] == length $f[1]; +for( my( $MAX, $c, $n, @f ) = ($ARGV[0] // 1e2,0); $c < $MAX; ) { + printf "%8d: %10d = %5d x %d\n", ++$c, $n, @f + if 2 == ( @f = factor ++$n ) && length $f[0] == length $f[1]; } warn 'Time taken: ', time-$time, "\n"; diff --git a/challenge-169/james-smith/perl/ch-2.pl b/challenge-169/james-smith/perl/ch-2.pl index 62a7e91631..c55acdc58d 100644 --- a/challenge-169/james-smith/perl/ch-2.pl +++ b/challenge-169/james-smith/perl/ch-2.pl @@ -26,9 +26,9 @@ my $time = time; # To pretty print the archilles numbers - we use our counter, and display # it alongside the number and the factorisation. -for( my( $n, $c, $MAX, @f ) = ( 2, 0, @ARGV ? $ARGV[0] : 1e2 ); $c<$MAX; $n++ ) { - say sprintf '%6d: %15d = %s', ++$c, $n, join ' . ', map { "$_->[0]^$_->[1]" } @f - if 1 == gcd map { $_->[1] < 2 ? next : $_->[1] } @f = factor_exp $n; +for( my( $MAX, $c, $n, @f ) = ($ARGV[0] // 1e2,0); $c<$MAX; ) { + say sprintf '%6d: %15d = %s', ++$c, $n, join ' . ', map { join '^', @$_ } @f + if 1 == gcd map { $_->[1] < 2 ? next : $_->[1] } @f = factor_exp ++$n; } warn 'Time taken: ', time-$time, "\n"; |