PNG  IHDR* pHYs+ IDATx]n#; cdLb Ǚ[at¤_:uP}>!Usă cag޿ ֵNu`ݼTâabO7uL&y^wFٝA"l[|ŲHLN밪4*sG3|Dv}?+y߉{OuOAt4Jj.u]Gz*҉sP'VQKbA1u\`& Af;HWj hsO;ogTu uj7S3/QzUr&wS`M$X_L7r2;aE+ώ%vikDA:dR+%KzƉo>eOth$z%: :{WwaQ:wz%4foɹE[9<]#ERINƻv溂E%P1i01 |Jvҗ&{b?9g=^wζXn/lK::90KwrюO\!ջ3uzuGv^;騢wq<Iatv09:tt~hEG`v;3@MNZD.1]L:{ծI3`L(÷ba")Y.iljCɄae#I"1 `3*Bdz>j<fU40⨬%O$3cGt]j%Fߠ_twJ;ABU8vP3uEԑwQ V:h%))LfraqX-ۿX]v-\9I gl8tzX ]ecm)-cgʒ#Uw=Wlێn(0hPP/ӨtQ“&J35 $=]r1{tLuǮ*i0_;NƝ8;-vݏr8+U-kruȕYr0RnC]*ެ(M:]gE;{]tg(#ZJ9y>utRDRMdr9㪩̞zֹb<ģ&wzJM"iI( .ꮅX)Qw:9,i좜\Ԛi7&N0:asϓc];=ΗOӣ APqz93 y $)A*kVHZwBƺnWNaby>XMN*45~ղM6Nvm;A=jֲ.~1}(9`KJ/V F9[=`~[;sRuk]rєT!)iQO)Y$V ی ۤmzWz5IM Zb )ˆC`6 rRa}qNmUfDsWuˤV{ Pݝ'=Kֳbg,UҘVz2ﴻnjNgBb{? ߮tcsͻQuxVCIY۠:(V뺕 ٥2;t`@Fo{Z9`;]wMzU~%UA蛚dI vGq\r82iu +St`cR.6U/M9IENDB` REDROOM
PHP 5.6.40
Preview: prime.pl Size: 1.88 KB
/proc/thread-self/root/usr/share/doc/perl-Math-BigInt/examples/prime.pl

#!/usr/bin/perl -w

BEGIN { unshift @INC, '../lib'; }	# uncomment to use old, org version

$| = 1;

use Math::BigInt;

# this is a complicated version of the prime number sieve.
# It is not optimized (since we want to benchmark as many features as
# possible).

$amount = Math::BigInt->new( shift || 1000000 );

@primes = (1,1,0); # any not defined number is prime, 0,1 are not, but 2 is
my $prime = Math::BigInt->new (3);	# start

# the loop below is faster in the old version than in the new, since it is
# the worst case for new lib: small numbers and lot's of bstr()/new().
# It also slows down the benchmark too much so we use slightly faster int here
$r = 0; my $a = $amount->numify();
for ($i = 3; $i < $a; $i++)		# int version
  {
  $primes[$i] = $r; $r = 1-$r;
  }

# find primes
OUTER:
while ($prime < $amount)
  {
  # find first unmarked, it is the next prime
  $cur = $prime;
  while ($primes[$cur])
    {
    $cur += 2; last OUTER if $cur >= $amount; 	# no more to do
    }
  # $cur is now new prime
  $str = "$cur"; $str =~ s/\+//; # unify output for comapre
  #print "$str $prime $amount\n";
  # now strike out all multiples of $cur
  $add = $cur*2;
  $prime = $cur + 2;			# next round start two higher
  $cur += $add;
  while ($cur < $amount)
    {
    $primes[$cur] = 1; $cur += $add;
    }
  }

$i = 0;
foreach (@primes)
  {
  push @real_primes, $i if $primes[$i] == 0;
  $i++;
  }
# uncomment to print em:
# foreach (@real_primes) { print "$_\n"; }

print "last prime: $real_primes[-1]\n";


# check against text
open FILE, '1000.txt' or die "Can't read 1000.txt: $!";
my @test;
while (<FILE>)
  {
  next if /^#/;
  next if /^\s*$/;
  $_ =~ s/\s+/ /g;
  $_ =~ s/^\s+//;
  $_ =~ s/\s+$//;
  push @test, split /\s+/,$_;
  }
close FILE;
my $i = 0;
foreach (@real_primes)
  {
  print "oups: $i: $test[$i] != $real_primes[$i]\n"
    if $test[$i] != $real_primes[$i]; $i++;
  last if $i >= 1000;
  }

print "done\n";

Directory Contents

Dirs: 0 × Files: 3

Name Size Perms Modified Actions
7.10 KB lrw-r--r-- 2016-11-17 21:26:34
Edit Download
4.09 KB lrw-r--r-- 2016-11-17 21:26:34
Edit Download
1.88 KB lrw-r--r-- 2016-11-17 21:26:34
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).
© 2026 REDROOM — Secure File Manager. All rights reserved. Built with ❤️ & Red Dark UI