| 12345678910111213141516171819202122232425262728293031323334353637 |
- #!/usr/bin/perl
- =begin
- perl example code for Ace
- =cut
- use strict;
- use warnings;
- my $num_primes = 0;
- my @primes;
- # Put 2 as the first prime so we won't have an empty array
- $primes[$num_primes] = 2;
- $num_primes++;
- MAIN_LOOP:
- for my $number_to_check (3 .. 200)
- {
- for my $p (0 .. ($num_primes-1))
- {
- if ($number_to_check % $primes[$p] == 0)
- {
- next MAIN_LOOP;
- }
- }
- # If we reached this point it means $number_to_check is not
- # divisable by any prime number that came before it.
- $primes[$num_primes] = $number_to_check;
- $num_primes++;
- }
- for my $p (0 .. ($num_primes-1))
- {
- print $primes[$p], ", ";
- }
- print "\n";
|