From f745a6413108ca816c7dc2776d2be012ed71efd9 Mon Sep 17 00:00:00 2001 From: drbaggy Date: Sat, 18 Jun 2022 01:48:08 +0100 Subject: remove unncessary bits --- challenge-169/james-smith/perl/ch-1-npp.pl | 6 +++--- challenge-169/james-smith/perl/ch-1.pl | 6 +++--- challenge-169/james-smith/perl/ch-2-npp.pl | 6 +++--- challenge-169/james-smith/perl/ch-2.pl | 8 ++++---- 4 files changed, 13 insertions(+), 13 deletions(-) diff --git a/challenge-169/james-smith/perl/ch-1-npp.pl b/challenge-169/james-smith/perl/ch-1-npp.pl index ce0b88c777..6b5c2d4c3b 100644 --- a/challenge-169/james-smith/perl/ch-1-npp.pl +++ b/challenge-169/james-smith/perl/ch-1-npp.pl @@ -10,9 +10,9 @@ use Time::HiRes qw(time); my $time = time; #------------------------------------------------------------------------------- -for( my( $c, $n, @f ) = 100; $c; ) { - $c--, say $n if 2 == ( @f = factor ++$n ) && length $f[0] == length $f[1]; +for( my( $c, $n, @f ) = $ARGV[0] // 100; $c; ) { + $c--, say $n if 2 == ( @f = factor ++$n ) && length $f[0] == length $f[1] } -warn 'Time taken: ', time-$time, "\n"; +warn 'Time taken: ', time-$time, "\n" diff --git a/challenge-169/james-smith/perl/ch-1.pl b/challenge-169/james-smith/perl/ch-1.pl index 775040f182..5671e8ce07 100644 --- a/challenge-169/james-smith/perl/ch-1.pl +++ b/challenge-169/james-smith/perl/ch-1.pl @@ -13,10 +13,10 @@ my $time = time; # must have preciesely 2 prime factors # THEN each factor must be the same length; -for( my( $MAX, $c, $n, @f ) = ($ARGV[0] // 1e2,0); $c < $MAX; ) { +for( my( $MAX, $c, $n, @f ) = ( $ARGV[0] // 100, 0 ); $c < $MAX; ) { printf "%8d: %10d = %5d x %d\n", ++$c, $n, @f - if 2 == ( @f = factor ++$n ) && length $f[0] == length $f[1]; + if 2 == ( @f = factor ++$n ) && length $f[0] == length $f[1] } -warn 'Time taken: ', time-$time, "\n"; +warn 'Time taken: ', time-$time, "\n" diff --git a/challenge-169/james-smith/perl/ch-2-npp.pl b/challenge-169/james-smith/perl/ch-2-npp.pl index a3d686dc25..590e015325 100644 --- a/challenge-169/james-smith/perl/ch-2-npp.pl +++ b/challenge-169/james-smith/perl/ch-2-npp.pl @@ -10,9 +10,9 @@ use Time::HiRes qw(time); my $time = time; #------------------------------------------------------------------------------- -for( my( $c, $n ) = ( 100 ); $c; ) { - $c--, say $n if 1 == gcd map{ $_->[1] < 2 ? next : $_->[1] } factor_exp ++$n; +for( my( $c, $n ) = $ARGV[0] // 100; $c; ) { + $c--, say $n if 1 == gcd map{ $_->[1] < 2 ? next : $_->[1] } factor_exp ++$n } -warn 'Time taken: ', time-$time, "\n"; +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 c55acdc58d..f6477524ae 100644 --- a/challenge-169/james-smith/perl/ch-2.pl +++ b/challenge-169/james-smith/perl/ch-2.pl @@ -1,4 +1,4 @@ -#!/usr/local/bin/perl +#/usr/local/bin/perl use strict; @@ -26,10 +26,10 @@ my $time = time; # To pretty print the archilles numbers - we use our counter, and display # it alongside the number and the factorisation. -for( my( $MAX, $c, $n, @f ) = ($ARGV[0] // 1e2,0); $c<$MAX; ) { +for( my( $MAX, $c, $n, @f ) = ( $ARGV[0] // 100, 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; + if 1 == gcd map { $_->[1] < 2 ? next : $_->[1] } @f = factor_exp ++$n } -warn 'Time taken: ', time-$time, "\n"; +warn 'Time taken: ', time-$time, "\n" -- cgit