Frobenius numbers: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: added solution) |
(Added solution for Action!) |
||
Line 82: | Line 82: | ||
24 => 8447 |
24 => 8447 |
||
25 => 9599 |
25 => 9599 |
||
</pre> |
|||
=={{header|Action!}}== |
|||
{{libheader|Action! Sieve of Eratosthenes}} |
|||
<lang Action!>INCLUDE "H6:SIEVE.ACT" |
|||
INT FUNC NextPrime(INT p BYTE ARRAY primes) |
|||
DO |
|||
p==+1 |
|||
UNTIL primes(p) |
|||
OD |
|||
RETURN (p) |
|||
PROC Main() |
|||
DEFINE MAXNUM="200" |
|||
BYTE ARRAY primes(MAXNUM+1) |
|||
INT p1,p2,f |
|||
Put(125) PutE() ;clear the screen |
|||
Sieve(primes,MAXNUM+1) |
|||
p2=2 |
|||
DO |
|||
p1=p2 |
|||
p2=NextPrime(p2,primes) |
|||
f=p1*p2-p1-p2 |
|||
IF f<10000 THEN |
|||
PrintI(f) Put(32) |
|||
ELSE |
|||
EXIT |
|||
FI |
|||
OD |
|||
RETURN</lang> |
|||
{{out}} |
|||
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Frobenius_numbers.png Screenshot from Atari 8-bit computer] |
|||
<pre> |
|||
1 7 23 59 119 191 287 395 615 839 1079 1439 1679 1931 2391 3015 3479 3959 4619 5039 5615 6395 7215 8447 9599 |
|||
</pre> |
</pre> |
||