Anonymous user
Palindromic primes: Difference between revisions
Added solution for Action!
(Added Quackery.) |
(Added solution for Action!) |
||
Line 5:
Find and show all palindromic primes <big>'''n'''</big>, where <big> '''n < 1000''' </big>
<br><br>
=={{header|Action!}}==
{{libheader|Action! Sieve of Eratosthenes}}
<lang Action!>INCLUDE "H6:SIEVE.ACT"
BYTE Func IsPalindromicPrime(INT i BYTE ARRAY primes)
BYTE d
INT rev,tmp
IF primes(i)=0 THEN
RETURN (0)
FI
rev=0 tmp=i
WHILE tmp#0
DO
d=tmp MOD 10
rev==*10
rev==+d
tmp==/10
OD
IF rev#i THEN
RETURN (0)
FI
RETURN (1)
PROC Main()
DEFINE MAX="999"
BYTE ARRAY primes(MAX+1)
INT i,count=[0]
Put(125) PutE() ;clear the screen
Sieve(primes,MAX+1)
FOR i=2 TO MAX
DO
IF IsPalindromicPrime(i,primes) THEN
PrintI(i) Put(32)
count==+1
FI
OD
PrintF("%E%EThere are %I palindromic primes",count)
RETURN</lang>
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Palindromic_primes.png Screenshot from Atari 8-bit computer]
<pre>
2 3 5 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929
There are 20 palindromic primes
</pre>
=={{header|ALGOL 68}}==
| |||