29 lines
545 B
Plaintext
29 lines
545 B
Plaintext
// Rosetta Code problem: http://rosettacode.org/wiki/Additive_primes
|
|
// by Galileo, 06/2022
|
|
|
|
limit = 500
|
|
|
|
dim flags(limit)
|
|
|
|
for i = 2 to limit
|
|
for k = i*i to limit step i
|
|
flags(k) = 1
|
|
next
|
|
if flags(i) = 0 primes$ = primes$ + str$(i) + " "
|
|
next
|
|
|
|
dim prim$(1)
|
|
|
|
n = token(primes$, prim$())
|
|
|
|
for i = 1 to n
|
|
sum = 0
|
|
num$ = prim$(i)
|
|
for j = 1 to len(num$)
|
|
sum = sum + val(mid$(num$, j, 1))
|
|
next
|
|
if instr(primes$, str$(sum) + " ") print prim$(i), " "; : count = count + 1
|
|
next
|
|
|
|
print "\nFound: ", count
|