Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Project Euler (a series of challenging mathematical/computer programming problems)

by Anonymous Monk
on Feb 11, 2006 at 21:56 UTC ( #529603=note: print w/ replies, xml ) Need Help??


in reply to Project Euler (a series of challenging mathematical/computer programming problems)

here's another one i thought was correct: 77.

my $target = 5_001; # also tried 5_000 my $max = 1_000_000; my @primes; my $sieve = ''; # generate list of primes for (my $try=2; $try <= $max; $try++) { next if vec($sieve, $try, 1); push @primes, $try; for (my $mults=$try*$try; $mults <= $max; $mults+=$try) { vec($sieve, $mults, 1) = 1; } } # number of composites <= n # http://research.att.com/~njas/sequences/A065855 # # equivalent to number of primes between prime(n) and n, so that's wha +t # i'm doing here for (my $i=0; $i<@primes; $i++) { my $j = 0; $j++ while $primes[$j] <= $i+1; my $count = 0; $j++ && $count++ while $primes[$j] < $primes[$i]; next if $count < $target; printf "%d: %d\n", $i+1, $count; last; }


Comment on Re: Project Euler (a series of challenging mathematical/computer programming problems)
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://529603]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2014-09-17 21:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (99 votes), past polls