Additive primes: Difference between revisions
→{{header|XPL0}}
Line 3,289:
54 additive primes found below 500.
</pre>
=={{header|Yabasic}}==
<lang Yabasic>// 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</lang>
{{out}}
<pre>2 3 5 7 11 23 29 41 43 47 61 67 83 89 101 113 131 137 139 151 157 173 179 191 193 197 199 223 227 229 241 263 269 281 283 311 313 317 331 337 353 359 373 379 397 401 409 421 443 449 461 463 467 487
Found: 54
---Program done, press RETURN---</pre>
| |||